./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20f8b62eff4e734254f2d93fb2faeb4ade7cfcb3503703e0a4da4a961e3bc50b
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:11:42,430 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:11:42,471 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:11:42,475 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:11:42,475 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:11:42,491 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:11:42,491 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:11:42,491 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:11:42,492 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:11:42,492 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:11:42,493 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:11:42,493 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:11:42,493 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:11:42,494 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:11:42,494 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:11:42,494 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:11:42,494 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:11:42,495 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:11:42,495 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:11:42,495 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:11:42,495 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:11:42,496 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:11:42,496 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:11:42,496 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:11:42,497 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:11:42,497 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:11:42,497 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:11:42,497 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:11:42,498 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:11:42,498 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:11:42,498 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:11:42,498 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:11:42,499 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:11:42,499 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:11:42,499 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:11:42,499 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:11:42,500 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:11:42,500 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:11:42,500 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:11:42,500 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:11:42,500 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:11:42,501 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20f8b62eff4e734254f2d93fb2faeb4ade7cfcb3503703e0a4da4a961e3bc50b
[2024-03-12 01:11:42,684 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:11:42,706 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:11:42,708 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:11:42,709 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:11:42,709 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:11:42,710 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-12 01:11:43,857 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:11:44,120 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:11:44,120 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-12 01:11:44,132 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/127ee6f74/24547351bd2d420791cfe34d4bc43ab6/FLAG62723d4bb
[2024-03-12 01:11:44,143 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/127ee6f74/24547351bd2d420791cfe34d4bc43ab6
[2024-03-12 01:11:44,144 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:11:44,146 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:11:44,146 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:11:44,146 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:11:44,150 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:11:44,151 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,151 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2975d977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44, skipping insertion in model container
[2024-03-12 01:11:44,152 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,186 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:11:44,436 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:11:44,444 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:11:44,478 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:11:44,542 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:11:44,543 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44 WrapperNode
[2024-03-12 01:11:44,543 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:11:44,544 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:11:44,544 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:11:44,544 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:11:44,550 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,563 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,581 INFO  L138                Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76
[2024-03-12 01:11:44,581 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:11:44,582 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:11:44,582 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:11:44,582 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:11:44,589 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,589 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,592 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,592 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,598 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,601 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,602 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,603 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,605 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:11:44,606 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:11:44,606 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:11:44,606 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:11:44,607 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (1/1) ...
[2024-03-12 01:11:44,612 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:11:44,620 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:11:44,634 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 01:11:44,638 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:11:44,663 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:11:44,663 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:11:44,664 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:11:44,665 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:11:44,800 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:11:44,801 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:11:44,974 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:11:44,982 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:11:44,983 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:11:44,984 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:11:44 BoogieIcfgContainer
[2024-03-12 01:11:44,984 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:11:44,985 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:11:44,986 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:11:44,988 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:11:44,988 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:11:44" (1/3) ...
[2024-03-12 01:11:44,988 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e4a074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:11:44, skipping insertion in model container
[2024-03-12 01:11:44,989 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:11:44" (2/3) ...
[2024-03-12 01:11:44,989 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e4a074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:11:44, skipping insertion in model container
[2024-03-12 01:11:44,989 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:11:44" (3/3) ...
[2024-03-12 01:11:44,990 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2024-03-12 01:11:44,995 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:11:45,002 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:11:45,002 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-12 01:11:45,002 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:11:45,045 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:11:45,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 209 flow
[2024-03-12 01:11:45,111 INFO  L124   PetriNetUnfolderBase]: 6/144 cut-off events.
[2024-03-12 01:11:45,112 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:11:45,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 6/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-03-12 01:11:45,116 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 209 flow
[2024-03-12 01:11:45,119 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 209 flow
[2024-03-12 01:11:45,125 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:11:45,131 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c9412f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:11:45,131 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-12 01:11:45,140 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:11:45,140 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-12 01:11:45,140 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:11:45,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:45,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:45,141 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:11:45,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:45,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 447786827, now seen corresponding path program 1 times
[2024-03-12 01:11:45,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:45,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863690886]
[2024-03-12 01:11:45,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:45,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:45,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:45,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:45,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:45,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863690886]
[2024-03-12 01:11:45,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863690886] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:45,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:45,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:45,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306556005]
[2024-03-12 01:11:45,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:45,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:11:45,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:45,478 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:11:45,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:11:45,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 101
[2024-03-12 01:11:45,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 209 flow. Second operand  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:45,589 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:45,589 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 101
[2024-03-12 01:11:45,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:45,634 INFO  L124   PetriNetUnfolderBase]: 1/145 cut-off events.
[2024-03-12 01:11:45,634 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 01:11:45,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 145 events. 1/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. 
[2024-03-12 01:11:45,635 INFO  L140   encePairwiseOnDemand]: 90/101 looper letters, 11 selfloop transitions, 2 changer transitions 6/103 dead transitions.
[2024-03-12 01:11:45,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 249 flow
[2024-03-12 01:11:45,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:45,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:45,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions.
[2024-03-12 01:11:45,648 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8811881188118812
[2024-03-12 01:11:45,648 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 534 transitions.
[2024-03-12 01:11:45,648 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions.
[2024-03-12 01:11:45,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:45,652 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions.
[2024-03-12 01:11:45,656 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:45,660 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:45,661 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:45,662 INFO  L175             Difference]: Start difference. First operand has 100 places, 101 transitions, 209 flow. Second operand 6 states and 534 transitions.
[2024-03-12 01:11:45,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 249 flow
[2024-03-12 01:11:45,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:45,667 INFO  L231             Difference]: Finished difference. Result has 109 places, 97 transitions, 219 flow
[2024-03-12 01:11:45,669 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=109, PETRI_TRANSITIONS=97}
[2024-03-12 01:11:45,672 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places.
[2024-03-12 01:11:45,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 219 flow
[2024-03-12 01:11:45,672 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:45,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:45,673 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:45,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:11:45,673 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:11:45,673 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:45,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103953729, now seen corresponding path program 1 times
[2024-03-12 01:11:45,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:45,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824099096]
[2024-03-12 01:11:45,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:45,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:45,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:45,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:45,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:45,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824099096]
[2024-03-12 01:11:45,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824099096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:45,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:45,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:45,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015156919]
[2024-03-12 01:11:45,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:45,975 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:45,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:45,976 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:45,976 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:46,163 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 101
[2024-03-12 01:11:46,164 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 219 flow. Second operand  has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,164 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:46,164 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 101
[2024-03-12 01:11:46,164 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:46,314 INFO  L124   PetriNetUnfolderBase]: 90/425 cut-off events.
[2024-03-12 01:11:46,314 INFO  L125   PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES.
[2024-03-12 01:11:46,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 701 conditions, 425 events. 90/425 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2037 event pairs, 52 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 588. Up to 200 conditions per place. 
[2024-03-12 01:11:46,317 INFO  L140   encePairwiseOnDemand]: 90/101 looper letters, 31 selfloop transitions, 22 changer transitions 0/118 dead transitions.
[2024-03-12 01:11:46,317 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 118 transitions, 367 flow
[2024-03-12 01:11:46,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:46,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:46,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 450 transitions.
[2024-03-12 01:11:46,319 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7425742574257426
[2024-03-12 01:11:46,320 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 450 transitions.
[2024-03-12 01:11:46,320 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 450 transitions.
[2024-03-12 01:11:46,320 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:46,320 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 450 transitions.
[2024-03-12 01:11:46,321 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,323 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,323 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,323 INFO  L175             Difference]: Start difference. First operand has 109 places, 97 transitions, 219 flow. Second operand 6 states and 450 transitions.
[2024-03-12 01:11:46,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 118 transitions, 367 flow
[2024-03-12 01:11:46,325 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 353 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-12 01:11:46,327 INFO  L231             Difference]: Finished difference. Result has 110 places, 118 transitions, 355 flow
[2024-03-12 01:11:46,327 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=110, PETRI_TRANSITIONS=118}
[2024-03-12 01:11:46,328 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places.
[2024-03-12 01:11:46,328 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 118 transitions, 355 flow
[2024-03-12 01:11:46,328 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,328 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:46,328 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:46,329 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:11:46,329 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:11:46,329 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:46,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 432467112, now seen corresponding path program 1 times
[2024-03-12 01:11:46,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:46,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523018987]
[2024-03-12 01:11:46,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:46,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:46,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:46,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:46,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:46,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523018987]
[2024-03-12 01:11:46,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523018987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:46,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:46,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:46,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564210373]
[2024-03-12 01:11:46,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:46,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:46,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:46,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:46,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:46,685 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 101
[2024-03-12 01:11:46,686 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 118 transitions, 355 flow. Second operand  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,686 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:46,686 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 101
[2024-03-12 01:11:46,686 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:46,908 INFO  L124   PetriNetUnfolderBase]: 197/671 cut-off events.
[2024-03-12 01:11:46,909 INFO  L125   PetriNetUnfolderBase]: For 159/189 co-relation queries the response was YES.
[2024-03-12 01:11:46,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 671 events. 197/671 cut-off events. For 159/189 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3663 event pairs, 36 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1329. Up to 341 conditions per place. 
[2024-03-12 01:11:46,917 INFO  L140   encePairwiseOnDemand]: 82/101 looper letters, 41 selfloop transitions, 64 changer transitions 7/177 dead transitions.
[2024-03-12 01:11:46,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 177 transitions, 753 flow
[2024-03-12 01:11:46,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:46,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:46,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions.
[2024-03-12 01:11:46,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8366336633663366
[2024-03-12 01:11:46,920 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 507 transitions.
[2024-03-12 01:11:46,920 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions.
[2024-03-12 01:11:46,920 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:46,920 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions.
[2024-03-12 01:11:46,922 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,923 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,924 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,924 INFO  L175             Difference]: Start difference. First operand has 110 places, 118 transitions, 355 flow. Second operand 6 states and 507 transitions.
[2024-03-12 01:11:46,924 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 177 transitions, 753 flow
[2024-03-12 01:11:46,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 177 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:46,933 INFO  L231             Difference]: Finished difference. Result has 120 places, 170 transitions, 833 flow
[2024-03-12 01:11:46,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=120, PETRI_TRANSITIONS=170}
[2024-03-12 01:11:46,935 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places.
[2024-03-12 01:11:46,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 170 transitions, 833 flow
[2024-03-12 01:11:46,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:46,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:46,936 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:46,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:11:46,936 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:11:46,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:46,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -540253893, now seen corresponding path program 1 times
[2024-03-12 01:11:46,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:46,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468132159]
[2024-03-12 01:11:46,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:46,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:46,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:47,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:11:47,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:47,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468132159]
[2024-03-12 01:11:47,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468132159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:47,185 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:47,185 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:47,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530737261]
[2024-03-12 01:11:47,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:47,186 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:47,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:47,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:47,187 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:47,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 101
[2024-03-12 01:11:47,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 170 transitions, 833 flow. Second operand  has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:47,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 101
[2024-03-12 01:11:47,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:47,542 INFO  L124   PetriNetUnfolderBase]: 208/743 cut-off events.
[2024-03-12 01:11:47,542 INFO  L125   PetriNetUnfolderBase]: For 608/671 co-relation queries the response was YES.
[2024-03-12 01:11:47,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 743 events. 208/743 cut-off events. For 608/671 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4456 event pairs, 15 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1971. Up to 271 conditions per place. 
[2024-03-12 01:11:47,546 INFO  L140   encePairwiseOnDemand]: 85/101 looper letters, 80 selfloop transitions, 36 changer transitions 0/200 dead transitions.
[2024-03-12 01:11:47,546 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 200 transitions, 1236 flow
[2024-03-12 01:11:47,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:47,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:47,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions.
[2024-03-12 01:11:47,548 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7788778877887789
[2024-03-12 01:11:47,548 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 472 transitions.
[2024-03-12 01:11:47,548 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions.
[2024-03-12 01:11:47,549 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:47,549 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions.
[2024-03-12 01:11:47,550 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,551 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,551 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,552 INFO  L175             Difference]: Start difference. First operand has 120 places, 170 transitions, 833 flow. Second operand 6 states and 472 transitions.
[2024-03-12 01:11:47,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 200 transitions, 1236 flow
[2024-03-12 01:11:47,558 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 200 transitions, 1218 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:47,560 INFO  L231             Difference]: Finished difference. Result has 122 places, 199 transitions, 1163 flow
[2024-03-12 01:11:47,561 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=122, PETRI_TRANSITIONS=199}
[2024-03-12 01:11:47,561 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places.
[2024-03-12 01:11:47,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 199 transitions, 1163 flow
[2024-03-12 01:11:47,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,562 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:47,562 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:47,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:11:47,563 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:11:47,564 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:47,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -1499105620, now seen corresponding path program 1 times
[2024-03-12 01:11:47,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:47,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455220529]
[2024-03-12 01:11:47,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:47,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:47,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:11:47,596 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:11:47,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:11:47,627 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:11:47,628 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:11:47,628 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-12 01:11:47,630 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-12 01:11:47,630 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-12 01:11:47,630 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-12 01:11:47,630 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-12 01:11:47,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-12 01:11:47,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-12 01:11:47,631 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:11:47,631 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-12 01:11:47,633 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:11:47,633 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:11:47,648 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:11:47,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow
[2024-03-12 01:11:47,671 INFO  L124   PetriNetUnfolderBase]: 11/263 cut-off events.
[2024-03-12 01:11:47,672 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 01:11:47,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 11/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 493 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. 
[2024-03-12 01:11:47,672 INFO  L82        GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow
[2024-03-12 01:11:47,673 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow
[2024-03-12 01:11:47,674 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:11:47,675 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c9412f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:11:47,675 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:11:47,678 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:11:47,678 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-12 01:11:47,678 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:11:47,678 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:47,678 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:47,678 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:11:47,678 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:47,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -1670539381, now seen corresponding path program 1 times
[2024-03-12 01:11:47,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:47,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281626245]
[2024-03-12 01:11:47,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:47,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:47,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:47,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:47,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:47,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281626245]
[2024-03-12 01:11:47,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281626245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:47,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:47,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:47,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157603194]
[2024-03-12 01:11:47,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:47,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:11:47,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:47,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:11:47,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:11:47,803 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 119
[2024-03-12 01:11:47,804 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 254 flow. Second operand  has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,804 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:47,804 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 119
[2024-03-12 01:11:47,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:47,843 INFO  L124   PetriNetUnfolderBase]: 3/261 cut-off events.
[2024-03-12 01:11:47,843 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-12 01:11:47,843 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 261 events. 3/261 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 523 event pairs, 0 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 168. Up to 32 conditions per place. 
[2024-03-12 01:11:47,844 INFO  L140   encePairwiseOnDemand]: 108/119 looper letters, 14 selfloop transitions, 2 changer transitions 6/122 dead transitions.
[2024-03-12 01:11:47,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 302 flow
[2024-03-12 01:11:47,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:47,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:47,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-03-12 01:11:47,846 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8865546218487395
[2024-03-12 01:11:47,846 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-03-12 01:11:47,846 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-03-12 01:11:47,846 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:47,846 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-03-12 01:11:47,847 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,848 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,849 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,849 INFO  L175             Difference]: Start difference. First operand has 119 places, 119 transitions, 254 flow. Second operand 6 states and 633 transitions.
[2024-03-12 01:11:47,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 302 flow
[2024-03-12 01:11:47,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:47,851 INFO  L231             Difference]: Finished difference. Result has 128 places, 116 transitions, 268 flow
[2024-03-12 01:11:47,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=128, PETRI_TRANSITIONS=116}
[2024-03-12 01:11:47,851 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places.
[2024-03-12 01:11:47,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 268 flow
[2024-03-12 01:11:47,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:47,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:47,852 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:47,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:11:47,852 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:11:47,852 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:47,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -139649160, now seen corresponding path program 1 times
[2024-03-12 01:11:47,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:47,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184968314]
[2024-03-12 01:11:47,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:47,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:47,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:48,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:48,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:48,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184968314]
[2024-03-12 01:11:48,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184968314] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:48,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:48,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:48,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734226221]
[2024-03-12 01:11:48,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:48,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:48,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:48,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:48,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:48,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 119
[2024-03-12 01:11:48,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 116 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:48,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:48,198 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 119
[2024-03-12 01:11:48,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:48,538 INFO  L124   PetriNetUnfolderBase]: 1143/3263 cut-off events.
[2024-03-12 01:11:48,539 INFO  L125   PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES.
[2024-03-12 01:11:48,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 3263 events. 1143/3263 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24951 event pairs, 764 based on Foata normal form. 0/2972 useless extension candidates. Maximal degree in co-relation 4312. Up to 1816 conditions per place. 
[2024-03-12 01:11:48,552 INFO  L140   encePairwiseOnDemand]: 104/119 looper letters, 38 selfloop transitions, 38 changer transitions 0/153 dead transitions.
[2024-03-12 01:11:48,552 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 494 flow
[2024-03-12 01:11:48,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:48,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:48,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions.
[2024-03-12 01:11:48,554 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7619047619047619
[2024-03-12 01:11:48,554 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 544 transitions.
[2024-03-12 01:11:48,554 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions.
[2024-03-12 01:11:48,554 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:48,554 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions.
[2024-03-12 01:11:48,555 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:48,556 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:48,557 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:48,557 INFO  L175             Difference]: Start difference. First operand has 128 places, 116 transitions, 268 flow. Second operand 6 states and 544 transitions.
[2024-03-12 01:11:48,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 494 flow
[2024-03-12 01:11:48,558 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 482 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:11:48,560 INFO  L231             Difference]: Finished difference. Result has 130 places, 153 transitions, 510 flow
[2024-03-12 01:11:48,560 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=130, PETRI_TRANSITIONS=153}
[2024-03-12 01:11:48,561 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places.
[2024-03-12 01:11:48,561 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 153 transitions, 510 flow
[2024-03-12 01:11:48,561 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:48,561 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:48,561 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:48,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 01:11:48,561 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:11:48,562 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:48,562 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909822513, now seen corresponding path program 1 times
[2024-03-12 01:11:48,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:48,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467142904]
[2024-03-12 01:11:48,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:48,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:48,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:48,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:48,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:48,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467142904]
[2024-03-12 01:11:48,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467142904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:48,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:48,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:48,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510292829]
[2024-03-12 01:11:48,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:48,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:48,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:48,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:48,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:48,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119
[2024-03-12 01:11:48,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 153 transitions, 510 flow. Second operand  has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:48,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:48,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119
[2024-03-12 01:11:48,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:49,535 INFO  L124   PetriNetUnfolderBase]: 2605/6208 cut-off events.
[2024-03-12 01:11:49,535 INFO  L125   PetriNetUnfolderBase]: For 1573/1736 co-relation queries the response was YES.
[2024-03-12 01:11:49,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14073 conditions, 6208 events. 2605/6208 cut-off events. For 1573/1736 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 48716 event pairs, 747 based on Foata normal form. 0/5793 useless extension candidates. Maximal degree in co-relation 11520. Up to 3531 conditions per place. 
[2024-03-12 01:11:49,568 INFO  L140   encePairwiseOnDemand]: 92/119 looper letters, 71 selfloop transitions, 124 changer transitions 0/280 dead transitions.
[2024-03-12 01:11:49,568 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 280 transitions, 1400 flow
[2024-03-12 01:11:49,569 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:49,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:49,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions.
[2024-03-12 01:11:49,570 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8753501400560224
[2024-03-12 01:11:49,570 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 625 transitions.
[2024-03-12 01:11:49,570 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions.
[2024-03-12 01:11:49,571 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:49,571 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions.
[2024-03-12 01:11:49,572 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:49,573 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:49,573 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:49,573 INFO  L175             Difference]: Start difference. First operand has 130 places, 153 transitions, 510 flow. Second operand 6 states and 625 transitions.
[2024-03-12 01:11:49,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 280 transitions, 1400 flow
[2024-03-12 01:11:49,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 280 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:49,580 INFO  L231             Difference]: Finished difference. Result has 140 places, 272 transitions, 1554 flow
[2024-03-12 01:11:49,580 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1554, PETRI_PLACES=140, PETRI_TRANSITIONS=272}
[2024-03-12 01:11:49,581 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places.
[2024-03-12 01:11:49,581 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 272 transitions, 1554 flow
[2024-03-12 01:11:49,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:49,581 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:49,581 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:49,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:11:49,582 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:11:49,582 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:49,582 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790302882, now seen corresponding path program 1 times
[2024-03-12 01:11:49,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:49,582 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554557524]
[2024-03-12 01:11:49,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:49,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:49,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:49,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:11:49,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:49,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554557524]
[2024-03-12 01:11:49,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554557524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:49,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:49,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:49,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621627310]
[2024-03-12 01:11:49,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:49,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:49,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:49,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:49,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:49,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 119
[2024-03-12 01:11:49,981 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 272 transitions, 1554 flow. Second operand  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:49,981 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:49,981 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 119
[2024-03-12 01:11:49,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:50,799 INFO  L124   PetriNetUnfolderBase]: 3224/7675 cut-off events.
[2024-03-12 01:11:50,799 INFO  L125   PetriNetUnfolderBase]: For 6719/7182 co-relation queries the response was YES.
[2024-03-12 01:11:50,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 7675 events. 3224/7675 cut-off events. For 6719/7182 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 62393 event pairs, 459 based on Foata normal form. 0/7329 useless extension candidates. Maximal degree in co-relation 19055. Up to 3823 conditions per place. 
[2024-03-12 01:11:50,846 INFO  L140   encePairwiseOnDemand]: 98/119 looper letters, 170 selfloop transitions, 88 changer transitions 0/360 dead transitions.
[2024-03-12 01:11:50,846 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 360 transitions, 2634 flow
[2024-03-12 01:11:50,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:50,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:50,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2024-03-12 01:11:50,850 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8053221288515406
[2024-03-12 01:11:50,851 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2024-03-12 01:11:50,851 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2024-03-12 01:11:50,852 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:50,852 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2024-03-12 01:11:50,854 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:50,856 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:50,856 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:50,856 INFO  L175             Difference]: Start difference. First operand has 140 places, 272 transitions, 1554 flow. Second operand 6 states and 575 transitions.
[2024-03-12 01:11:50,856 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 360 transitions, 2634 flow
[2024-03-12 01:11:50,884 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 360 transitions, 2616 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:50,888 INFO  L231             Difference]: Finished difference. Result has 150 places, 352 transitions, 2504 flow
[2024-03-12 01:11:50,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2504, PETRI_PLACES=150, PETRI_TRANSITIONS=352}
[2024-03-12 01:11:50,889 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places.
[2024-03-12 01:11:50,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 352 transitions, 2504 flow
[2024-03-12 01:11:50,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:50,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:50,889 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:50,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 01:11:50,889 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:11:50,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:50,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -1826722711, now seen corresponding path program 1 times
[2024-03-12 01:11:50,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:50,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125406427]
[2024-03-12 01:11:50,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:50,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:50,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:51,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:11:51,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:51,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125406427]
[2024-03-12 01:11:51,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125406427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:51,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:51,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:11:51,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502225630]
[2024-03-12 01:11:51,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:51,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:11:51,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:51,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:11:51,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:11:51,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119
[2024-03-12 01:11:51,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 352 transitions, 2504 flow. Second operand  has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:51,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:51,304 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119
[2024-03-12 01:11:51,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:52,257 INFO  L124   PetriNetUnfolderBase]: 3687/8460 cut-off events.
[2024-03-12 01:11:52,257 INFO  L125   PetriNetUnfolderBase]: For 15132/15594 co-relation queries the response was YES.
[2024-03-12 01:11:52,274 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30651 conditions, 8460 events. 3687/8460 cut-off events. For 15132/15594 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 68052 event pairs, 333 based on Foata normal form. 0/8152 useless extension candidates. Maximal degree in co-relation 25534. Up to 4189 conditions per place. 
[2024-03-12 01:11:52,300 INFO  L140   encePairwiseOnDemand]: 104/119 looper letters, 206 selfloop transitions, 124 changer transitions 0/473 dead transitions.
[2024-03-12 01:11:52,300 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 473 transitions, 4302 flow
[2024-03-12 01:11:52,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:52,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:52,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions.
[2024-03-12 01:11:52,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8487394957983193
[2024-03-12 01:11:52,302 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 606 transitions.
[2024-03-12 01:11:52,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions.
[2024-03-12 01:11:52,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:52,303 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions.
[2024-03-12 01:11:52,304 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:52,305 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:52,305 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:52,306 INFO  L175             Difference]: Start difference. First operand has 150 places, 352 transitions, 2504 flow. Second operand 6 states and 606 transitions.
[2024-03-12 01:11:52,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 473 transitions, 4302 flow
[2024-03-12 01:11:52,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 473 transitions, 4062 flow, removed 120 selfloop flow, removed 0 redundant places.
[2024-03-12 01:11:52,342 INFO  L231             Difference]: Finished difference. Result has 160 places, 471 transitions, 3984 flow
[2024-03-12 01:11:52,343 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=160, PETRI_TRANSITIONS=471}
[2024-03-12 01:11:52,343 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places.
[2024-03-12 01:11:52,343 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 471 transitions, 3984 flow
[2024-03-12 01:11:52,343 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:52,343 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:52,344 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:52,344 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:11:52,344 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:11:52,344 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:52,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 107044070, now seen corresponding path program 1 times
[2024-03-12 01:11:52,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:52,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478197512]
[2024-03-12 01:11:52,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:52,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:52,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:52,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:52,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:52,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478197512]
[2024-03-12 01:11:52,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478197512] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:11:52,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450338292]
[2024-03-12 01:11:52,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:52,676 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:11:52,676 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:11:52,677 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:11:52,702 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 01:11:52,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:52,801 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-12 01:11:52,807 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:11:52,860 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:11:52,890 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:11:52,892 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:11:52,953 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-12 01:11:52,970 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-03-12 01:11:52,990 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:11:52,991 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-03-12 01:11:53,011 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:11:53,012 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-03-12 01:11:53,043 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34
[2024-03-12 01:11:53,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:53,053 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:11:53,099 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-12 01:11:53,132 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))) is different from false
[2024-03-12 01:11:53,180 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-12 01:11:53,390 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:11:53,390 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2024-03-12 01:11:53,398 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:11:53,398 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32
[2024-03-12 01:11:53,407 INFO  L349             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-12 01:11:53,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-12 01:11:53,413 INFO  L349             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-12 01:11:53,413 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-12 01:11:53,418 INFO  L349             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-12 01:11:53,419 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-12 01:11:53,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:53,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450338292] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:11:53,489 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:11:53,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19
[2024-03-12 01:11:53,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122563499]
[2024-03-12 01:11:53,489 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:11:53,490 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-03-12 01:11:53,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:53,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-03-12 01:11:53,491 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=222, Unknown=7, NotChecked=96, Total=380
[2024-03-12 01:11:53,640 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119
[2024-03-12 01:11:53,641 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 471 transitions, 3984 flow. Second operand  has 20 states, 20 states have (on average 56.85) internal successors, (1137), 20 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:53,642 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:53,642 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119
[2024-03-12 01:11:53,642 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:11:59,863 INFO  L124   PetriNetUnfolderBase]: 11518/22703 cut-off events.
[2024-03-12 01:11:59,863 INFO  L125   PetriNetUnfolderBase]: For 43625/43680 co-relation queries the response was YES.
[2024-03-12 01:11:59,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85243 conditions, 22703 events. 11518/22703 cut-off events. For 43625/43680 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 191421 event pairs, 653 based on Foata normal form. 225/21865 useless extension candidates. Maximal degree in co-relation 73378. Up to 7166 conditions per place. 
[2024-03-12 01:11:59,986 INFO  L140   encePairwiseOnDemand]: 91/119 looper letters, 946 selfloop transitions, 553 changer transitions 43/1600 dead transitions.
[2024-03-12 01:11:59,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1600 transitions, 15564 flow
[2024-03-12 01:11:59,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-03-12 01:11:59,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-03-12 01:11:59,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2674 transitions.
[2024-03-12 01:11:59,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6073131955484896
[2024-03-12 01:11:59,992 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2674 transitions.
[2024-03-12 01:11:59,992 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2674 transitions.
[2024-03-12 01:11:59,994 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:59,994 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2674 transitions.
[2024-03-12 01:11:59,998 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 72.27027027027027) internal successors, (2674), 37 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:00,003 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:00,004 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:00,004 INFO  L175             Difference]: Start difference. First operand has 160 places, 471 transitions, 3984 flow. Second operand 37 states and 2674 transitions.
[2024-03-12 01:12:00,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1600 transitions, 15564 flow
[2024-03-12 01:12:00,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 1600 transitions, 15264 flow, removed 150 selfloop flow, removed 0 redundant places.
[2024-03-12 01:12:00,210 INFO  L231             Difference]: Finished difference. Result has 219 places, 918 transitions, 10189 flow
[2024-03-12 01:12:00,211 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3822, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10189, PETRI_PLACES=219, PETRI_TRANSITIONS=918}
[2024-03-12 01:12:00,211 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 100 predicate places.
[2024-03-12 01:12:00,211 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 918 transitions, 10189 flow
[2024-03-12 01:12:00,212 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 56.85) internal successors, (1137), 20 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:00,212 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:12:00,212 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:12:00,227 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-12 01:12:00,412 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:12:00,413 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:12:00,414 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:12:00,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 868131320, now seen corresponding path program 1 times
[2024-03-12 01:12:00,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:12:00,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485368610]
[2024-03-12 01:12:00,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:12:00,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:12:00,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:12:00,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:00,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:12:00,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485368610]
[2024-03-12 01:12:00,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485368610] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:12:00,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649476772]
[2024-03-12 01:12:00,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:12:00,774 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:12:00,774 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:12:00,776 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:12:00,780 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 01:12:00,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:12:00,894 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-12 01:12:00,896 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:12:01,064 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:12:01,182 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:12:01,182 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:12:01,427 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:12:01,472 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:12:01,522 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:12:01,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:12:01,641 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 01:12:01,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:01,701 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:12:01,731 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-12 01:12:01,747 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-03-12 01:12:01,770 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 01:12:01,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:01,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [649476772] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:12:01,995 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:12:01,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 37
[2024-03-12 01:12:01,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96000695]
[2024-03-12 01:12:01,996 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:12:01,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-03-12 01:12:01,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:12:01,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-03-12 01:12:01,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1057, Unknown=3, NotChecked=204, Total=1406
[2024-03-12 01:12:02,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-03-12 01:12:02,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 918 transitions, 10189 flow. Second operand  has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:02,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:12:02,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-03-12 01:12:02,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:12:15,307 INFO  L124   PetriNetUnfolderBase]: 21737/42230 cut-off events.
[2024-03-12 01:12:15,307 INFO  L125   PetriNetUnfolderBase]: For 310921/311062 co-relation queries the response was YES.
[2024-03-12 01:12:15,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 220770 conditions, 42230 events. 21737/42230 cut-off events. For 310921/311062 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 385674 event pairs, 2336 based on Foata normal form. 267/40335 useless extension candidates. Maximal degree in co-relation 211110. Up to 14507 conditions per place. 
[2024-03-12 01:12:15,725 INFO  L140   encePairwiseOnDemand]: 79/119 looper letters, 1732 selfloop transitions, 982 changer transitions 32/2796 dead transitions.
[2024-03-12 01:12:15,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2796 transitions, 37755 flow
[2024-03-12 01:12:15,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2024-03-12 01:12:15,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2024-03-12 01:12:15,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2606 transitions.
[2024-03-12 01:12:15,732 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43798319327731094
[2024-03-12 01:12:15,732 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 2606 transitions.
[2024-03-12 01:12:15,732 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 2606 transitions.
[2024-03-12 01:12:15,733 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:12:15,733 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2606 transitions.
[2024-03-12 01:12:15,738 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 52.12) internal successors, (2606), 50 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:15,743 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:15,744 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:15,744 INFO  L175             Difference]: Start difference. First operand has 219 places, 918 transitions, 10189 flow. Second operand 50 states and 2606 transitions.
[2024-03-12 01:12:15,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2796 transitions, 37755 flow
[2024-03-12 01:12:18,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 2796 transitions, 36383 flow, removed 681 selfloop flow, removed 3 redundant places.
[2024-03-12 01:12:18,908 INFO  L231             Difference]: Finished difference. Result has 283 places, 1804 transitions, 25440 flow
[2024-03-12 01:12:18,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=9657, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=25440, PETRI_PLACES=283, PETRI_TRANSITIONS=1804}
[2024-03-12 01:12:18,909 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 164 predicate places.
[2024-03-12 01:12:18,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 1804 transitions, 25440 flow
[2024-03-12 01:12:18,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:18,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:12:18,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:12:18,917 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 01:12:19,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-12 01:12:19,111 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:12:19,112 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:12:19,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 2010273922, now seen corresponding path program 2 times
[2024-03-12 01:12:19,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:12:19,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141523832]
[2024-03-12 01:12:19,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:12:19,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:12:19,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:12:19,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:19,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:12:19,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141523832]
[2024-03-12 01:12:19,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141523832] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:12:19,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430074698]
[2024-03-12 01:12:19,579 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 01:12:19,579 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:12:19,579 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:12:19,580 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:12:19,581 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 01:12:19,687 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:12:19,688 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:12:19,689 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-12 01:12:19,695 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:12:19,703 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:12:19,776 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:12:19,777 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:12:19,942 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:12:19,976 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:12:20,019 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:12:20,074 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:12:20,239 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 01:12:20,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:20,282 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:12:20,315 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-12 01:12:20,402 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-12 01:12:20,433 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-12 01:12:20,459 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 01:12:20,481 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-03-12 01:12:20,506 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:20,506 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-03-12 01:12:20,512 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:20,512 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-03-12 01:12:20,516 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-12 01:12:20,528 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:12:20,529 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:12:20,537 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:12:20,538 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:12:20,549 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:12:20,550 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:12:20,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:20,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [430074698] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:12:20,589 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:12:20,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31
[2024-03-12 01:12:20,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510390453]
[2024-03-12 01:12:20,590 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:12:20,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-12 01:12:20,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:12:20,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-12 01:12:20,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=602, Unknown=5, NotChecked=270, Total=992
[2024-03-12 01:12:20,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-12 01:12:20,721 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1804 transitions, 25440 flow. Second operand  has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:20,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:12:20,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-12 01:12:20,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:12:46,091 INFO  L124   PetriNetUnfolderBase]: 33987/67664 cut-off events.
[2024-03-12 01:12:46,091 INFO  L125   PetriNetUnfolderBase]: For 817578/817934 co-relation queries the response was YES.
[2024-03-12 01:12:46,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 394785 conditions, 67664 events. 33987/67664 cut-off events. For 817578/817934 co-relation queries the response was YES. Maximal size of possible extension queue 1919. Compared 678063 event pairs, 3961 based on Foata normal form. 158/64831 useless extension candidates. Maximal degree in co-relation 388374. Up to 24227 conditions per place. 
[2024-03-12 01:12:47,034 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2302 selfloop transitions, 1329 changer transitions 38/3734 dead transitions.
[2024-03-12 01:12:47,034 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 3734 transitions, 59987 flow
[2024-03-12 01:12:47,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-03-12 01:12:47,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-03-12 01:12:47,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2550 transitions.
[2024-03-12 01:12:47,039 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5791505791505791
[2024-03-12 01:12:47,039 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2550 transitions.
[2024-03-12 01:12:47,039 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2550 transitions.
[2024-03-12 01:12:47,040 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:12:47,040 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2550 transitions.
[2024-03-12 01:12:47,043 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 68.91891891891892) internal successors, (2550), 37 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:47,047 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:47,048 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:47,048 INFO  L175             Difference]: Start difference. First operand has 283 places, 1804 transitions, 25440 flow. Second operand 37 states and 2550 transitions.
[2024-03-12 01:12:47,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 3734 transitions, 59987 flow
[2024-03-12 01:12:57,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3734 transitions, 59733 flow, removed 100 selfloop flow, removed 17 redundant places.
[2024-03-12 01:12:57,412 INFO  L231             Difference]: Finished difference. Result has 322 places, 2617 transitions, 44520 flow
[2024-03-12 01:12:57,414 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=25278, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=44520, PETRI_PLACES=322, PETRI_TRANSITIONS=2617}
[2024-03-12 01:12:57,414 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 203 predicate places.
[2024-03-12 01:12:57,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 2617 transitions, 44520 flow
[2024-03-12 01:12:57,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:57,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:12:57,415 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:12:57,422 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 01:12:57,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:12:57,616 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:12:57,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:12:57,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 565757044, now seen corresponding path program 3 times
[2024-03-12 01:12:57,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:12:57,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428836961]
[2024-03-12 01:12:57,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:12:57,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:12:57,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:12:57,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:57,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:12:57,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428836961]
[2024-03-12 01:12:57,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428836961] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:12:57,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485525427]
[2024-03-12 01:12:57,952 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 01:12:57,952 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:12:57,952 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:12:57,953 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:12:57,954 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-12 01:12:58,060 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 01:12:58,061 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:12:58,062 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-12 01:12:58,066 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:12:58,073 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:12:58,126 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:12:58,126 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:12:58,279 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:12:58,374 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:12:58,415 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:12:58,467 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:12:58,532 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 01:12:58,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:58,574 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:12:58,598 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-12 01:12:58,631 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false
[2024-03-12 01:12:58,653 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 01:12:58,674 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-03-12 01:12:58,724 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-12 01:12:58,742 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:58,743 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-12 01:12:58,750 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:58,751 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-12 01:12:58,754 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-12 01:12:58,761 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:12:58,761 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:12:58,767 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:12:58,767 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:12:58,772 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:12:58,773 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-12 01:12:58,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:58,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [485525427] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:12:58,843 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:12:58,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33
[2024-03-12 01:12:58,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722676839]
[2024-03-12 01:12:58,844 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:12:58,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-12 01:12:58,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:12:58,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-12 01:12:58,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=719, Unknown=5, NotChecked=290, Total=1122
[2024-03-12 01:12:58,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-12 01:12:58,879 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2617 transitions, 44520 flow. Second operand  has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:12:58,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:12:58,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-12 01:12:58,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:13:40,310 INFO  L124   PetriNetUnfolderBase]: 41281/81091 cut-off events.
[2024-03-12 01:13:40,310 INFO  L125   PetriNetUnfolderBase]: For 1184505/1185171 co-relation queries the response was YES.
[2024-03-12 01:13:41,253 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 517196 conditions, 81091 events. 41281/81091 cut-off events. For 1184505/1185171 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 817191 event pairs, 4266 based on Foata normal form. 399/77960 useless extension candidates. Maximal degree in co-relation 514339. Up to 30000 conditions per place. 
[2024-03-12 01:13:41,625 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2623 selfloop transitions, 2150 changer transitions 35/4873 dead transitions.
[2024-03-12 01:13:41,626 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4873 transitions, 90219 flow
[2024-03-12 01:13:41,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-12 01:13:41,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-12 01:13:41,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2742 transitions.
[2024-03-12 01:13:41,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5760504201680672
[2024-03-12 01:13:41,629 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2742 transitions.
[2024-03-12 01:13:41,629 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2742 transitions.
[2024-03-12 01:13:41,630 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:13:41,630 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2742 transitions.
[2024-03-12 01:13:41,633 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.55) internal successors, (2742), 40 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:13:41,637 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:13:41,638 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:13:41,638 INFO  L175             Difference]: Start difference. First operand has 322 places, 2617 transitions, 44520 flow. Second operand 40 states and 2742 transitions.
[2024-03-12 01:13:41,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 4873 transitions, 90219 flow
[2024-03-12 01:14:02,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4873 transitions, 89529 flow, removed 297 selfloop flow, removed 14 redundant places.
[2024-03-12 01:14:02,255 INFO  L231             Difference]: Finished difference. Result has 368 places, 3656 transitions, 73189 flow
[2024-03-12 01:14:02,256 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=44102, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=73189, PETRI_PLACES=368, PETRI_TRANSITIONS=3656}
[2024-03-12 01:14:02,257 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 249 predicate places.
[2024-03-12 01:14:02,257 INFO  L495      AbstractCegarLoop]: Abstraction has has 368 places, 3656 transitions, 73189 flow
[2024-03-12 01:14:02,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:14:02,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:14:02,258 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:14:02,264 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-12 01:14:02,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-12 01:14:02,459 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:14:02,460 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:14:02,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507148684, now seen corresponding path program 4 times
[2024-03-12 01:14:02,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:14:02,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177760280]
[2024-03-12 01:14:02,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:14:02,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:14:02,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:14:02,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:14:02,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:14:02,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177760280]
[2024-03-12 01:14:02,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177760280] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:14:02,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92134609]
[2024-03-12 01:14:02,808 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 01:14:02,808 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:14:02,808 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:14:02,809 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:14:02,811 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-12 01:14:03,014 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 01:14:03,014 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:14:03,017 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-03-12 01:14:03,022 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:14:03,027 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:14:03,079 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:14:03,079 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:14:03,315 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:14:03,351 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:14:03,402 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:14:03,544 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:14:03,615 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41
[2024-03-12 01:14:03,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:14:03,652 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:14:36,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:14:36,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [92134609] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:14:36,150 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:14:36,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38
[2024-03-12 01:14:36,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520529105]
[2024-03-12 01:14:36,150 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:14:36,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-03-12 01:14:36,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:14:36,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-03-12 01:14:36,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1297, Unknown=7, NotChecked=0, Total=1482
[2024-03-12 01:14:40,395 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:14:44,606 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:14:49,191 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:14:53,354 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:14:57,755 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:02,362 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:06,773 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:11,013 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:15,278 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:19,966 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:24,368 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:28,525 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:32,666 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:36,852 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:40,978 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:45,135 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:49,337 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:53,366 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:15:57,475 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:01,763 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:06,546 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:10,716 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:14,851 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:18,878 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:23,019 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:27,307 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:16:27,323 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-12 01:16:27,325 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 3656 transitions, 73189 flow. Second operand  has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:16:27,326 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:16:27,326 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-12 01:16:27,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:17:39,504 INFO  L124   PetriNetUnfolderBase]: 46908/92554 cut-off events.
[2024-03-12 01:17:39,504 INFO  L125   PetriNetUnfolderBase]: For 1994329/1995154 co-relation queries the response was YES.
[2024-03-12 01:17:40,905 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 646641 conditions, 92554 events. 46908/92554 cut-off events. For 1994329/1995154 co-relation queries the response was YES. Maximal size of possible extension queue 2541. Compared 952761 event pairs, 4720 based on Foata normal form. 351/88964 useless extension candidates. Maximal degree in co-relation 642787. Up to 34528 conditions per place. 
[2024-03-12 01:17:41,358 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2996 selfloop transitions, 2313 changer transitions 38/5412 dead transitions.
[2024-03-12 01:17:41,358 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 5412 transitions, 114848 flow
[2024-03-12 01:17:41,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-12 01:17:41,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-12 01:17:41,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2734 transitions.
[2024-03-12 01:17:41,361 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5743697478991596
[2024-03-12 01:17:41,362 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2734 transitions.
[2024-03-12 01:17:41,362 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2734 transitions.
[2024-03-12 01:17:41,362 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:17:41,362 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2734 transitions.
[2024-03-12 01:17:41,366 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.35) internal successors, (2734), 40 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:17:41,369 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:17:41,369 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:17:41,369 INFO  L175             Difference]: Start difference. First operand has 368 places, 3656 transitions, 73189 flow. Second operand 40 states and 2734 transitions.
[2024-03-12 01:17:41,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 5412 transitions, 114848 flow
[2024-03-12 01:18:15,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 5412 transitions, 111590 flow, removed 1568 selfloop flow, removed 15 redundant places.
[2024-03-12 01:18:15,667 INFO  L231             Difference]: Finished difference. Result has 412 places, 4308 transitions, 94931 flow
[2024-03-12 01:18:15,669 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=70607, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=94931, PETRI_PLACES=412, PETRI_TRANSITIONS=4308}
[2024-03-12 01:18:15,670 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 293 predicate places.
[2024-03-12 01:18:15,670 INFO  L495      AbstractCegarLoop]: Abstraction has has 412 places, 4308 transitions, 94931 flow
[2024-03-12 01:18:15,670 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:18:15,670 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:18:15,670 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:18:15,679 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-03-12 01:18:15,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:18:15,871 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:18:15,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:18:15,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -50739582, now seen corresponding path program 5 times
[2024-03-12 01:18:15,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:18:15,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493226093]
[2024-03-12 01:18:15,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:18:15,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:18:15,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:18:16,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:18:16,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:18:16,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493226093]
[2024-03-12 01:18:16,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493226093] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:18:16,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339623173]
[2024-03-12 01:18:16,268 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-12 01:18:16,268 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:18:16,269 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:18:16,270 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:18:16,271 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-12 01:18:16,370 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:18:16,370 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:18:16,372 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-12 01:18:16,376 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:18:16,527 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:18:16,693 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:18:16,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:18:16,943 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:18:17,015 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:18:17,152 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:18:17,227 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:18:17,328 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 01:18:17,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:18:17,387 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:18:17,411 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-12 01:18:17,447 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)))) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-03-12 01:18:17,685 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 01:18:17,710 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-03-12 01:18:17,772 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:18:17,772 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-12 01:18:17,777 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:18:17,778 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-12 01:18:17,781 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-12 01:18:17,797 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:18:17,798 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:18:17,806 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:18:17,806 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-12 01:18:17,814 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:18:17,814 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:18:17,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:18:17,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339623173] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:18:17,995 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:18:17,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 39
[2024-03-12 01:18:17,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772377493]
[2024-03-12 01:18:17,995 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:18:17,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-03-12 01:18:17,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:18:17,996 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-03-12 01:18:17,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1124, Unknown=14, NotChecked=284, Total=1560
[2024-03-12 01:18:18,106 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-03-12 01:18:18,107 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 4308 transitions, 94931 flow. Second operand  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:18:18,107 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:18:18,107 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-03-12 01:18:18,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:19:50,056 INFO  L124   PetriNetUnfolderBase]: 52741/103349 cut-off events.
[2024-03-12 01:19:50,056 INFO  L125   PetriNetUnfolderBase]: For 2404715/2405785 co-relation queries the response was YES.
[2024-03-12 01:19:51,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 753517 conditions, 103349 events. 52741/103349 cut-off events. For 2404715/2405785 co-relation queries the response was YES. Maximal size of possible extension queue 2772. Compared 1070682 event pairs, 4988 based on Foata normal form. 525/99420 useless extension candidates. Maximal degree in co-relation 748417. Up to 38946 conditions per place. 
[2024-03-12 01:19:52,516 INFO  L140   encePairwiseOnDemand]: 74/119 looper letters, 3317 selfloop transitions, 2903 changer transitions 40/6310 dead transitions.
[2024-03-12 01:19:52,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 6310 transitions, 144714 flow
[2024-03-12 01:19:52,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2024-03-12 01:19:52,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2024-03-12 01:19:52,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2670 transitions.
[2024-03-12 01:19:52,520 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44873949579831934
[2024-03-12 01:19:52,520 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 2670 transitions.
[2024-03-12 01:19:52,520 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 2670 transitions.
[2024-03-12 01:19:52,521 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:19:52,521 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2670 transitions.
[2024-03-12 01:19:52,524 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 53.4) internal successors, (2670), 50 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:19:52,527 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:19:52,528 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:19:52,528 INFO  L175             Difference]: Start difference. First operand has 412 places, 4308 transitions, 94931 flow. Second operand 50 states and 2670 transitions.
[2024-03-12 01:19:52,528 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 6310 transitions, 144714 flow
[2024-03-12 01:20:41,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 6310 transitions, 143297 flow, removed 618 selfloop flow, removed 18 redundant places.
[2024-03-12 01:20:41,221 INFO  L231             Difference]: Finished difference. Result has 463 places, 5049 transitions, 123932 flow
[2024-03-12 01:20:41,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=93842, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=123932, PETRI_PLACES=463, PETRI_TRANSITIONS=5049}
[2024-03-12 01:20:41,224 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 344 predicate places.
[2024-03-12 01:20:41,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 463 places, 5049 transitions, 123932 flow
[2024-03-12 01:20:41,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:20:41,224 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:41,224 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:20:41,232 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-12 01:20:41,425 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-12 01:20:41,425 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:41,426 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:41,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -1091376008, now seen corresponding path program 6 times
[2024-03-12 01:20:41,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:41,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183456489]
[2024-03-12 01:20:41,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:41,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:41,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:41,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:20:41,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:41,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183456489]
[2024-03-12 01:20:41,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183456489] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:20:41,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310675825]
[2024-03-12 01:20:41,867 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-12 01:20:41,867 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:20:41,867 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:20:41,868 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:20:41,869 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-12 01:20:41,970 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-12 01:20:41,970 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:20:41,971 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-12 01:20:41,975 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:20:41,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:20:42,055 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:20:42,055 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:20:42,285 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:20:42,325 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:20:42,387 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:20:42,460 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:20:42,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 01:20:42,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:20:42,775 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:20:42,804 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-12 01:20:42,880 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-12 01:20:43,560 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:20:43,560 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-03-12 01:20:43,566 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:20:43,567 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-03-12 01:20:43,571 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-12 01:20:43,582 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:20:43,583 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:20:43,593 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:20:43,593 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:20:43,600 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:20:43,600 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-12 01:20:43,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:20:43,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [310675825] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:20:43,709 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:20:43,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34
[2024-03-12 01:20:43,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439457111]
[2024-03-12 01:20:43,709 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:20:43,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-12 01:20:43,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:43,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-12 01:20:43,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=853, Unknown=51, NotChecked=126, Total=1190
[2024-03-12 01:20:43,997 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-12 01:20:43,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 5049 transitions, 123932 flow. Second operand  has 35 states, 35 states have (on average 52.94285714285714) internal successors, (1853), 35 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:20:43,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:43,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-12 01:20:43,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:22:40,736 INFO  L124   PetriNetUnfolderBase]: 56550/112259 cut-off events.
[2024-03-12 01:22:40,737 INFO  L125   PetriNetUnfolderBase]: For 2912846/2914008 co-relation queries the response was YES.
[2024-03-12 01:22:43,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 851317 conditions, 112259 events. 56550/112259 cut-off events. For 2912846/2914008 co-relation queries the response was YES. Maximal size of possible extension queue 3092. Compared 1191584 event pairs, 6309 based on Foata normal form. 466/107979 useless extension candidates. Maximal degree in co-relation 845775. Up to 57749 conditions per place. 
[2024-03-12 01:22:43,747 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 3071 selfloop transitions, 2882 changer transitions 34/6053 dead transitions.
[2024-03-12 01:22:43,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 6053 transitions, 156988 flow
[2024-03-12 01:22:43,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-12 01:22:43,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-12 01:22:43,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1937 transitions.
[2024-03-12 01:22:43,751 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5612865835989568
[2024-03-12 01:22:43,751 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1937 transitions.
[2024-03-12 01:22:43,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1937 transitions.
[2024-03-12 01:22:43,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:22:43,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1937 transitions.
[2024-03-12 01:22:43,753 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 66.79310344827586) internal successors, (1937), 29 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:22:43,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:22:43,756 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:22:43,756 INFO  L175             Difference]: Start difference. First operand has 463 places, 5049 transitions, 123932 flow. Second operand 29 states and 1937 transitions.
[2024-03-12 01:22:43,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 6053 transitions, 156988 flow
[2024-03-12 01:23:51,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 6053 transitions, 155596 flow, removed 626 selfloop flow, removed 20 redundant places.
[2024-03-12 01:23:51,499 INFO  L231             Difference]: Finished difference. Result has 487 places, 5570 transitions, 148812 flow
[2024-03-12 01:23:51,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=122552, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=148812, PETRI_PLACES=487, PETRI_TRANSITIONS=5570}
[2024-03-12 01:23:51,502 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 368 predicate places.
[2024-03-12 01:23:51,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 487 places, 5570 transitions, 148812 flow
[2024-03-12 01:23:51,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 52.94285714285714) internal successors, (1853), 35 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:23:51,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:23:51,503 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:23:51,511 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-12 01:23:51,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-12 01:23:51,705 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:23:51,705 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:23:51,706 INFO  L85        PathProgramCache]: Analyzing trace with hash -1120615654, now seen corresponding path program 7 times
[2024-03-12 01:23:51,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:23:51,706 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882414491]
[2024-03-12 01:23:51,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:23:51,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:23:51,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:23:52,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:23:52,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:23:52,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882414491]
[2024-03-12 01:23:52,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882414491] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:23:52,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450394031]
[2024-03-12 01:23:52,105 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-03-12 01:23:52,105 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:23:52,105 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:23:52,107 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:23:52,108 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-12 01:23:52,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:23:52,241 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-12 01:23:52,245 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:23:52,390 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 01:23:52,563 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 01:23:52,563 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-12 01:23:52,808 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 01:23:52,991 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 01:23:53,058 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 01:23:53,135 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 01:23:53,240 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 01:23:53,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:23:53,307 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:23:53,339 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-12 01:23:53,378 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-12 01:23:53,628 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-12 01:23:54,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:23:54,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [450394031] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:23:54,187 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:23:54,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 39
[2024-03-12 01:23:54,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068712138]
[2024-03-12 01:23:54,188 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:23:54,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-03-12 01:23:54,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:23:54,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-03-12 01:23:54,190 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1175, Unknown=27, NotChecked=216, Total=1560
[2024-03-12 01:23:54,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-03-12 01:23:54,553 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 5570 transitions, 148812 flow. Second operand  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:23:54,553 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:23:54,553 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-03-12 01:23:54,553 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
