./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/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 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:40:15,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:40:15,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:40:15,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:40:15,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:40:15,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:40:15,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:40:15,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:40:15,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:40:15,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:40:15,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:40:15,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:40:15,259 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:40:15,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:40:15,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:40:15,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:40:15,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:40:15,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:40:15,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:40:15,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:40:15,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:40:15,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:40:15,267 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:40:15,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:40:15,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:40:15,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:40:15,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:40:15,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:40:15,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:40:15,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:40:15,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:40:15,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:15,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:40:15,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:40:15,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:40:15,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:40:15,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:40:15,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:40:15,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:40:15,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:40:15,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:40:15,277 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:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2024-11-12 12:40:15,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:40:15,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:40:15,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:40:15,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:40:15,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:40:15,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-11-12 12:40:16,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:40:17,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:40:17,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-11-12 12:40:17,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05afb5352/445aed7179be4733bcc3593fefb5710b/FLAG995b1a08c [2024-11-12 12:40:17,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05afb5352/445aed7179be4733bcc3593fefb5710b [2024-11-12 12:40:17,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:40:17,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:40:17,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:17,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:40:17,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:40:17,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e226fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17, skipping insertion in model container [2024-11-12 12:40:17,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:40:17,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:17,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:40:17,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:17,517 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:40:17,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17 WrapperNode [2024-11-12 12:40:17,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:17,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:17,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:40:17,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:40:17,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,609 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 348 [2024-11-12 12:40:17,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:17,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:40:17,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:40:17,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:40:17,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:40:17,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:40:17,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:40:17,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:40:17,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (1/1) ... [2024-11-12 12:40:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:17,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:40:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:40:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:40:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:40:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:40:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:40:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:40:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:40:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:40:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:40:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:40:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 12:40:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 12:40:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:40:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:40:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:40:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:40:17,846 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:40:17,996 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:40:17,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:40:18,560 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:40:18,560 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:40:18,765 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:40:18,765 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 12:40:18,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:18 BoogieIcfgContainer [2024-11-12 12:40:18,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:40:18,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:40:18,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:40:18,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:40:18,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:40:17" (1/3) ... [2024-11-12 12:40:18,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc2646e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:18, skipping insertion in model container [2024-11-12 12:40:18,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:17" (2/3) ... [2024-11-12 12:40:18,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc2646e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:18, skipping insertion in model container [2024-11-12 12:40:18,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:18" (3/3) ... [2024-11-12 12:40:18,780 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2024-11-12 12:40:18,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:40:18,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-11-12 12:40:18,829 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:18,932 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:40:18,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 510 transitions, 1041 flow [2024-11-12 12:40:19,097 INFO L124 PetriNetUnfolderBase]: 27/507 cut-off events. [2024-11-12 12:40:19,098 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:40:19,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 507 events. 27/507 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 632 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 428. Up to 2 conditions per place. [2024-11-12 12:40:19,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 510 transitions, 1041 flow [2024-11-12 12:40:19,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 463 transitions, 944 flow [2024-11-12 12:40:19,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:19,126 INFO L333 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, 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;@50b79c02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:19,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2024-11-12 12:40:19,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:19,131 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-12 12:40:19,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:19,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:19,132 INFO L206 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] [2024-11-12 12:40:19,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:19,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash 64313588, now seen corresponding path program 1 times [2024-11-12 12:40:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944056931] [2024-11-12 12:40:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944056931] [2024-11-12 12:40:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944056931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469762182] [2024-11-12 12:40:19,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:19,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:19,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 510 [2024-11-12 12:40:19,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 463 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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-11-12 12:40:19,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:19,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 510 [2024-11-12 12:40:19,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:19,666 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2024-11-12 12:40:19,666 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-12 12:40:19,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6484 event pairs, 51 based on Foata normal form. 12/1018 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2024-11-12 12:40:19,676 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2024-11-12 12:40:19,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2024-11-12 12:40:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2024-11-12 12:40:19,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235294117647059 [2024-11-12 12:40:19,693 INFO L175 Difference]: Start difference. First operand has 449 places, 463 transitions, 944 flow. Second operand 3 states and 1413 transitions. [2024-11-12 12:40:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2024-11-12 12:40:19,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-12 12:40:19,703 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2024-11-12 12:40:19,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-11-12 12:40:19,708 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2024-11-12 12:40:19,708 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2024-11-12 12:40:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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-11-12 12:40:19,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:19,710 INFO L206 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-11-12 12:40:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:19,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash -123107398, now seen corresponding path program 1 times [2024-11-12 12:40:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083573714] [2024-11-12 12:40:19,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:19,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-11-12 12:40:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083573714] [2024-11-12 12:40:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083573714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636494450] [2024-11-12 12:40:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:19,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:19,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:19,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-12 12:40:19,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-11-12 12:40:19,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:19,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-12 12:40:19,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:19,937 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2024-11-12 12:40:19,937 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-12 12:40:19,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6518 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2024-11-12 12:40:19,947 INFO L140 encePairwiseOnDemand]: 502/510 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2024-11-12 12:40:19,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2024-11-12 12:40:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2024-11-12 12:40:19,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947712418300654 [2024-11-12 12:40:19,950 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2024-11-12 12:40:19,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2024-11-12 12:40:20,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,006 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2024-11-12 12:40:20,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2024-11-12 12:40:20,008 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2024-11-12 12:40:20,008 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2024-11-12 12:40:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-11-12 12:40:20,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,009 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:20,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 573243807, now seen corresponding path program 1 times [2024-11-12 12:40:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955459138] [2024-11-12 12:40:20,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955459138] [2024-11-12 12:40:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955459138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068574162] [2024-11-12 12:40:20,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:20,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 510 [2024-11-12 12:40:20,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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-11-12 12:40:20,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 510 [2024-11-12 12:40:20,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,036 INFO L124 PetriNetUnfolderBase]: 236/1331 cut-off events. [2024-11-12 12:40:21,037 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-12 12:40:21,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 1331 events. 236/1331 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7716 event pairs, 188 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1775. Up to 406 conditions per place. [2024-11-12 12:40:21,046 INFO L140 encePairwiseOnDemand]: 492/510 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2024-11-12 12:40:21,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2024-11-12 12:40:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2024-11-12 12:40:21,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7996732026143791 [2024-11-12 12:40:21,051 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2024-11-12 12:40:21,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2024-11-12 12:40:21,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:21,056 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2024-11-12 12:40:21,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2024-11-12 12:40:21,059 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2024-11-12 12:40:21,059 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2024-11-12 12:40:21,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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-11-12 12:40:21,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,061 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:21,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:21,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:21,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1149357642, now seen corresponding path program 1 times [2024-11-12 12:40:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133579163] [2024-11-12 12:40:21,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133579163] [2024-11-12 12:40:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133579163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228076743] [2024-11-12 12:40:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-11-12 12:40:21,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-11-12 12:40:21,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-11-12 12:40:21,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,256 INFO L124 PetriNetUnfolderBase]: 55/587 cut-off events. [2024-11-12 12:40:21,257 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:40:21,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 587 events. 55/587 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1808 event pairs, 34 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 661. Up to 77 conditions per place. [2024-11-12 12:40:21,260 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-12 12:40:21,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2024-11-12 12:40:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-11-12 12:40:21,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-12 12:40:21,262 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2024-11-12 12:40:21,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2024-11-12 12:40:21,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:21,268 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2024-11-12 12:40:21,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2024-11-12 12:40:21,269 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2024-11-12 12:40:21,269 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2024-11-12 12:40:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-11-12 12:40:21,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,270 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:21,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:21,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:21,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1852644211, now seen corresponding path program 1 times [2024-11-12 12:40:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969792727] [2024-11-12 12:40:21,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969792727] [2024-11-12 12:40:21,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969792727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945772593] [2024-11-12 12:40:21,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-11-12 12:40:21,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-11-12 12:40:21,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-11-12 12:40:21,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,411 INFO L124 PetriNetUnfolderBase]: 55/586 cut-off events. [2024-11-12 12:40:21,412 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:40:21,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 586 events. 55/586 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1712 event pairs, 34 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 647. Up to 77 conditions per place. [2024-11-12 12:40:21,415 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2024-11-12 12:40:21,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2024-11-12 12:40:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-11-12 12:40:21,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-12 12:40:21,418 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2024-11-12 12:40:21,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2024-11-12 12:40:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:21,423 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2024-11-12 12:40:21,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-11-12 12:40:21,425 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2024-11-12 12:40:21,425 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2024-11-12 12:40:21,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-11-12 12:40:21,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,426 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:21,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:21,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1332480732, now seen corresponding path program 1 times [2024-11-12 12:40:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219489418] [2024-11-12 12:40:21,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219489418] [2024-11-12 12:40:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219489418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235348016] [2024-11-12 12:40:21,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-11-12 12:40:21,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-11-12 12:40:21,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-11-12 12:40:21,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,677 INFO L124 PetriNetUnfolderBase]: 23/449 cut-off events. [2024-11-12 12:40:21,680 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:40:21,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 449 events. 23/449 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 757 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 462. Up to 35 conditions per place. [2024-11-12 12:40:21,683 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2024-11-12 12:40:21,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2024-11-12 12:40:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-12 12:40:21,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-12 12:40:21,690 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2024-11-12 12:40:21,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2024-11-12 12:40:21,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:21,703 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2024-11-12 12:40:21,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2024-11-12 12:40:21,704 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-11-12 12:40:21,704 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2024-11-12 12:40:21,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-11-12 12:40:21,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,710 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:21,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:21,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1889059969, now seen corresponding path program 1 times [2024-11-12 12:40:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025998637] [2024-11-12 12:40:21,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025998637] [2024-11-12 12:40:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025998637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669329343] [2024-11-12 12:40:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-11-12 12:40:21,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-11-12 12:40:21,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-11-12 12:40:21,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,877 INFO L124 PetriNetUnfolderBase]: 23/448 cut-off events. [2024-11-12 12:40:21,878 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:40:21,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 448 events. 23/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 759 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 461. Up to 35 conditions per place. [2024-11-12 12:40:21,880 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-12 12:40:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2024-11-12 12:40:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-12 12:40:21,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-12 12:40:21,884 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2024-11-12 12:40:21,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2024-11-12 12:40:21,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:21,890 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2024-11-12 12:40:21,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2024-11-12 12:40:21,891 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-11-12 12:40:21,891 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2024-11-12 12:40:21,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-11-12 12:40:21,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,893 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:21,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:21,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 30063585, now seen corresponding path program 1 times [2024-11-12 12:40:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932506649] [2024-11-12 12:40:21,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932506649] [2024-11-12 12:40:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932506649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849998094] [2024-11-12 12:40:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-11-12 12:40:21,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-11-12 12:40:21,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-11-12 12:40:21,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:22,110 INFO L124 PetriNetUnfolderBase]: 109/1164 cut-off events. [2024-11-12 12:40:22,110 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-11-12 12:40:22,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1164 events. 109/1164 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5661 event pairs, 56 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 1290. Up to 135 conditions per place. [2024-11-12 12:40:22,116 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2024-11-12 12:40:22,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2024-11-12 12:40:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-11-12 12:40:22,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-11-12 12:40:22,119 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2024-11-12 12:40:22,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2024-11-12 12:40:22,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:22,124 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2024-11-12 12:40:22,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2024-11-12 12:40:22,126 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-11-12 12:40:22,126 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2024-11-12 12:40:22,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-11-12 12:40:22,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:22,128 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:22,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:22,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 360475418, now seen corresponding path program 1 times [2024-11-12 12:40:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612924005] [2024-11-12 12:40:22,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:22,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612924005] [2024-11-12 12:40:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612924005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:22,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:22,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800744892] [2024-11-12 12:40:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:22,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:22,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-11-12 12:40:22,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-11-12 12:40:22,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:22,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-11-12 12:40:22,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,009 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2024-11-12 12:40:23,010 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-12 12:40:23,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1132 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2024-11-12 12:40:23,013 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2024-11-12 12:40:23,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2024-11-12 12:40:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-11-12 12:40:23,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-11-12 12:40:23,018 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2024-11-12 12:40:23,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2024-11-12 12:40:23,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:23,025 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2024-11-12 12:40:23,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-11-12 12:40:23,027 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2024-11-12 12:40:23,027 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2024-11-12 12:40:23,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-11-12 12:40:23,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,029 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:23,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:23,029 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash -555120169, now seen corresponding path program 1 times [2024-11-12 12:40:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653350787] [2024-11-12 12:40:23,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653350787] [2024-11-12 12:40:23,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653350787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630344572] [2024-11-12 12:40:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-11-12 12:40:23,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-11-12 12:40:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-11-12 12:40:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,183 INFO L124 PetriNetUnfolderBase]: 69/627 cut-off events. [2024-11-12 12:40:23,183 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-12 12:40:23,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 627 events. 69/627 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1973 event pairs, 36 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 757. Up to 98 conditions per place. [2024-11-12 12:40:23,189 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-11-12 12:40:23,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2024-11-12 12:40:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-11-12 12:40:23,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-11-12 12:40:23,192 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2024-11-12 12:40:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2024-11-12 12:40:23,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 12:40:23,197 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2024-11-12 12:40:23,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2024-11-12 12:40:23,198 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-11-12 12:40:23,199 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2024-11-12 12:40:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-11-12 12:40:23,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,200 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:23,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:23,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -620784319, now seen corresponding path program 1 times [2024-11-12 12:40:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897292649] [2024-11-12 12:40:23,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897292649] [2024-11-12 12:40:23,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897292649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927447462] [2024-11-12 12:40:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-11-12 12:40:23,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-11-12 12:40:23,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-11-12 12:40:23,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,379 INFO L124 PetriNetUnfolderBase]: 125/1187 cut-off events. [2024-11-12 12:40:23,380 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-12 12:40:23,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1187 events. 125/1187 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5853 event pairs, 58 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1384. Up to 158 conditions per place. [2024-11-12 12:40:23,388 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2024-11-12 12:40:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2024-11-12 12:40:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-11-12 12:40:23,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-11-12 12:40:23,391 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2024-11-12 12:40:23,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2024-11-12 12:40:23,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:23,396 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2024-11-12 12:40:23,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2024-11-12 12:40:23,397 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2024-11-12 12:40:23,397 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2024-11-12 12:40:23,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-11-12 12:40:23,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,398 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:23,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:23,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1135693127, now seen corresponding path program 1 times [2024-11-12 12:40:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114576444] [2024-11-12 12:40:23,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114576444] [2024-11-12 12:40:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114576444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619812145] [2024-11-12 12:40:23,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:24,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-11-12 12:40:24,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-11-12 12:40:24,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:24,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-11-12 12:40:24,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:24,277 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2024-11-12 12:40:24,277 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-12 12:40:24,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1107 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-11-12 12:40:24,283 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2024-11-12 12:40:24,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2024-11-12 12:40:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-11-12 12:40:24,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-11-12 12:40:24,292 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2024-11-12 12:40:24,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2024-11-12 12:40:24,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:24,308 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2024-11-12 12:40:24,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2024-11-12 12:40:24,312 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2024-11-12 12:40:24,313 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2024-11-12 12:40:24,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-11-12 12:40:24,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:24,315 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:24,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:24,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:24,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1178971585, now seen corresponding path program 1 times [2024-11-12 12:40:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:24,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626486888] [2024-11-12 12:40:24,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626486888] [2024-11-12 12:40:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626486888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472810517] [2024-11-12 12:40:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:24,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:24,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-11-12 12:40:24,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-11-12 12:40:24,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:24,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-11-12 12:40:24,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:24,639 INFO L124 PetriNetUnfolderBase]: 69/620 cut-off events. [2024-11-12 12:40:24,639 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-11-12 12:40:24,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 620 events. 69/620 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1912 event pairs, 36 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 752. Up to 98 conditions per place. [2024-11-12 12:40:24,650 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-12 12:40:24,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2024-11-12 12:40:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-11-12 12:40:24,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-11-12 12:40:24,653 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2024-11-12 12:40:24,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2024-11-12 12:40:24,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:24,669 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2024-11-12 12:40:24,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2024-11-12 12:40:24,670 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2024-11-12 12:40:24,670 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2024-11-12 12:40:24,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-11-12 12:40:24,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:24,672 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:24,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:24,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1081886323, now seen corresponding path program 1 times [2024-11-12 12:40:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205456407] [2024-11-12 12:40:24,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:24,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205456407] [2024-11-12 12:40:24,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205456407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:24,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:24,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420327241] [2024-11-12 12:40:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:24,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:24,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:24,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:24,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-12 12:40:24,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-11-12 12:40:24,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:24,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-12 12:40:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:24,921 INFO L124 PetriNetUnfolderBase]: 31/461 cut-off events. [2024-11-12 12:40:24,921 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-12 12:40:24,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 461 events. 31/461 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 843 event pairs, 14 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 506. Up to 50 conditions per place. [2024-11-12 12:40:24,928 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-11-12 12:40:24,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2024-11-12 12:40:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-11-12 12:40:24,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9124183006535947 [2024-11-12 12:40:24,934 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2024-11-12 12:40:24,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2024-11-12 12:40:24,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:24,939 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2024-11-12 12:40:24,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2024-11-12 12:40:24,944 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2024-11-12 12:40:24,945 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2024-11-12 12:40:24,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-11-12 12:40:24,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:24,950 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:24,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:24,950 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 688744348, now seen corresponding path program 1 times [2024-11-12 12:40:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:24,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186790700] [2024-11-12 12:40:24,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:40:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186790700] [2024-11-12 12:40:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186790700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379337305] [2024-11-12 12:40:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:25,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:25,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:25,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:25,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-12 12:40:25,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-11-12 12:40:25,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:25,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-12 12:40:25,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:25,282 INFO L124 PetriNetUnfolderBase]: 113/1198 cut-off events. [2024-11-12 12:40:25,282 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-12 12:40:25,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1198 events. 113/1198 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6615 event pairs, 25 based on Foata normal form. 0/1089 useless extension candidates. Maximal degree in co-relation 1392. Up to 91 conditions per place. [2024-11-12 12:40:25,288 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2024-11-12 12:40:25,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2024-11-12 12:40:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2024-11-12 12:40:25,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196078431372549 [2024-11-12 12:40:25,291 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2024-11-12 12:40:25,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2024-11-12 12:40:25,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:25,296 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2024-11-12 12:40:25,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2024-11-12 12:40:25,297 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2024-11-12 12:40:25,298 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2024-11-12 12:40:25,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-11-12 12:40:25,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:25,298 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:25,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:25,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1410606142, now seen corresponding path program 1 times [2024-11-12 12:40:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:25,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857185420] [2024-11-12 12:40:25,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:40:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857185420] [2024-11-12 12:40:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857185420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:40:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326480640] [2024-11-12 12:40:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:40:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:40:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:40:25,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 510 [2024-11-12 12:40:25,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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-11-12 12:40:25,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:25,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 510 [2024-11-12 12:40:25,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:26,234 INFO L124 PetriNetUnfolderBase]: 256/1901 cut-off events. [2024-11-12 12:40:26,234 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-12 12:40:26,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1901 events. 256/1901 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9860 event pairs, 122 based on Foata normal form. 9/1758 useless extension candidates. Maximal degree in co-relation 2446. Up to 245 conditions per place. [2024-11-12 12:40:26,245 INFO L140 encePairwiseOnDemand]: 481/510 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2024-11-12 12:40:26,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2024-11-12 12:40:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:40:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 12:40:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2024-11-12 12:40:26,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709803921568627 [2024-11-12 12:40:26,256 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2024-11-12 12:40:26,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2024-11-12 12:40:26,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:26,263 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2024-11-12 12:40:26,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2024-11-12 12:40:26,264 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-11-12 12:40:26,264 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2024-11-12 12:40:26,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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-11-12 12:40:26,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:26,265 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:26,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:26,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:26,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1577782458, now seen corresponding path program 1 times [2024-11-12 12:40:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863572917] [2024-11-12 12:40:26,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:40:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863572917] [2024-11-12 12:40:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863572917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:26,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:26,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922034092] [2024-11-12 12:40:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:26,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:26,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 510 [2024-11-12 12:40:26,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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-11-12 12:40:26,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:26,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 510 [2024-11-12 12:40:26,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:26,467 INFO L124 PetriNetUnfolderBase]: 87/956 cut-off events. [2024-11-12 12:40:26,468 INFO L125 PetriNetUnfolderBase]: For 68/80 co-relation queries the response was YES. [2024-11-12 12:40:26,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 956 events. 87/956 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2739 event pairs, 39 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1202. Up to 125 conditions per place. [2024-11-12 12:40:26,473 INFO L140 encePairwiseOnDemand]: 508/510 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-11-12 12:40:26,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2024-11-12 12:40:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2024-11-12 12:40:26,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9183006535947712 [2024-11-12 12:40:26,476 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2024-11-12 12:40:26,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2024-11-12 12:40:26,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:26,484 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2024-11-12 12:40:26,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2024-11-12 12:40:26,484 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-11-12 12:40:26,485 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2024-11-12 12:40:26,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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-11-12 12:40:26,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:26,486 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:26,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:40:26,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1541076308, now seen corresponding path program 1 times [2024-11-12 12:40:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703700093] [2024-11-12 12:40:26,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:40:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703700093] [2024-11-12 12:40:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703700093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210256944] [2024-11-12 12:40:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:26,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-12 12:40:26,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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-11-12 12:40:26,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:26,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-12 12:40:26,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:26,852 INFO L124 PetriNetUnfolderBase]: 238/2127 cut-off events. [2024-11-12 12:40:26,853 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-12 12:40:26,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 2127 events. 238/2127 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12968 event pairs, 61 based on Foata normal form. 4/1994 useless extension candidates. Maximal degree in co-relation 2737. Up to 176 conditions per place. [2024-11-12 12:40:26,867 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2024-11-12 12:40:26,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2024-11-12 12:40:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2024-11-12 12:40:26,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918954248366013 [2024-11-12 12:40:26,870 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2024-11-12 12:40:26,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2024-11-12 12:40:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:26,876 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2024-11-12 12:40:26,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2024-11-12 12:40:26,877 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-11-12 12:40:26,877 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2024-11-12 12:40:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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-11-12 12:40:26,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:26,878 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:40:26,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1969656587, now seen corresponding path program 1 times [2024-11-12 12:40:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380805297] [2024-11-12 12:40:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 12:40:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380805297] [2024-11-12 12:40:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380805297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588794652] [2024-11-12 12:40:27,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:27,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:27,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:27,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:40:27,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 12:40:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:27,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 12:40:27,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 12:40:27,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:40:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 12:40:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588794652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:40:28,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:40:28,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-12 12:40:28,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265660763] [2024-11-12 12:40:28,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:40:28,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 12:40:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:28,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 12:40:28,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-12 12:40:28,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 510 [2024-11-12 12:40:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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-11-12 12:40:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 510 [2024-11-12 12:40:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:30,076 INFO L124 PetriNetUnfolderBase]: 491/2909 cut-off events. [2024-11-12 12:40:30,076 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-11-12 12:40:30,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2909 events. 491/2909 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18077 event pairs, 201 based on Foata normal form. 9/2686 useless extension candidates. Maximal degree in co-relation 4164. Up to 437 conditions per place. [2024-11-12 12:40:30,093 INFO L140 encePairwiseOnDemand]: 471/510 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2024-11-12 12:40:30,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2024-11-12 12:40:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:40:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-12 12:40:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2024-11-12 12:40:30,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479876160990713 [2024-11-12 12:40:30,104 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2024-11-12 12:40:30,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2024-11-12 12:40:30,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-11-12 12:40:30,112 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2024-11-12 12:40:30,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2024-11-12 12:40:30,113 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2024-11-12 12:40:30,113 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2024-11-12 12:40:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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-11-12 12:40:30,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:30,116 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:30,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 12:40:30,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:30,317 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:30,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -562157278, now seen corresponding path program 2 times [2024-11-12 12:40:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172212365] [2024-11-12 12:40:30,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-12 12:40:30,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172212365] [2024-11-12 12:40:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172212365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:30,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89352411] [2024-11-12 12:40:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:30,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:30,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:30,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:30,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:31,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-11-12 12:40:31,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-11-12 12:40:31,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:31,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-11-12 12:40:31,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:32,193 INFO L124 PetriNetUnfolderBase]: 653/3303 cut-off events. [2024-11-12 12:40:32,193 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-11-12 12:40:32,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5006 conditions, 3303 events. 653/3303 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25168 event pairs, 130 based on Foata normal form. 0/3059 useless extension candidates. Maximal degree in co-relation 4956. Up to 607 conditions per place. [2024-11-12 12:40:32,224 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2024-11-12 12:40:32,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2024-11-12 12:40:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-11-12 12:40:32,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-11-12 12:40:32,229 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2024-11-12 12:40:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2024-11-12 12:40:32,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-12 12:40:32,240 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2024-11-12 12:40:32,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2024-11-12 12:40:32,241 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2024-11-12 12:40:32,241 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2024-11-12 12:40:32,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-11-12 12:40:32,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:32,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:32,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:40:32,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:32,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 592738246, now seen corresponding path program 1 times [2024-11-12 12:40:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238726822] [2024-11-12 12:40:32,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-12 12:40:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238726822] [2024-11-12 12:40:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238726822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-12 12:40:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859567571] [2024-11-12 12:40:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 12:40:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 12:40:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-12 12:40:37,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-11-12 12:40:37,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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-11-12 12:40:37,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:37,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-11-12 12:40:37,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:40,267 INFO L124 PetriNetUnfolderBase]: 1671/7904 cut-off events. [2024-11-12 12:40:40,267 INFO L125 PetriNetUnfolderBase]: For 3160/3664 co-relation queries the response was YES. [2024-11-12 12:40:40,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13758 conditions, 7904 events. 1671/7904 cut-off events. For 3160/3664 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 81514 event pairs, 448 based on Foata normal form. 180/7364 useless extension candidates. Maximal degree in co-relation 13710. Up to 1419 conditions per place. [2024-11-12 12:40:40,316 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 82 selfloop transitions, 44 changer transitions 0/468 dead transitions. [2024-11-12 12:40:40,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 468 transitions, 1579 flow [2024-11-12 12:40:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 12:40:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-12 12:40:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13254 transitions. [2024-11-12 12:40:40,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8121323529411765 [2024-11-12 12:40:40,330 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 32 states and 13254 transitions. [2024-11-12 12:40:40,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 468 transitions, 1579 flow [2024-11-12 12:40:40,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 468 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:40,341 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1330 flow [2024-11-12 12:40:40,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1330, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2024-11-12 12:40:40,342 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -9 predicate places. [2024-11-12 12:40:40,343 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1330 flow [2024-11-12 12:40:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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-11-12 12:40:40,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:40,345 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 12:40:40,345 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:40,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1817904910, now seen corresponding path program 2 times [2024-11-12 12:40:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:40,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203525030] [2024-11-12 12:40:40,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-12 12:40:41,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203525030] [2024-11-12 12:40:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203525030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:41,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-12 12:40:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764859918] [2024-11-12 12:40:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:41,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 12:40:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 12:40:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-12 12:40:45,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-11-12 12:40:45,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1330 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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-11-12 12:40:45,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:45,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-11-12 12:40:45,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:49,065 INFO L124 PetriNetUnfolderBase]: 2275/11656 cut-off events. [2024-11-12 12:40:49,065 INFO L125 PetriNetUnfolderBase]: For 10570/12098 co-relation queries the response was YES. [2024-11-12 12:40:49,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22460 conditions, 11656 events. 2275/11656 cut-off events. For 10570/12098 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 128633 event pairs, 608 based on Foata normal form. 196/10671 useless extension candidates. Maximal degree in co-relation 22407. Up to 1914 conditions per place. [2024-11-12 12:40:49,149 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 101 selfloop transitions, 50 changer transitions 0/493 dead transitions. [2024-11-12 12:40:49,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 493 transitions, 1971 flow [2024-11-12 12:40:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 12:40:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-12 12:40:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13253 transitions. [2024-11-12 12:40:49,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8120710784313725 [2024-11-12 12:40:49,159 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1330 flow. Second operand 32 states and 13253 transitions. [2024-11-12 12:40:49,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 493 transitions, 1971 flow [2024-11-12 12:40:49,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 493 transitions, 1920 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-11-12 12:40:49,179 INFO L231 Difference]: Finished difference. Result has 449 places, 451 transitions, 1578 flow [2024-11-12 12:40:49,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1578, PETRI_PLACES=449, PETRI_TRANSITIONS=451} [2024-11-12 12:40:49,180 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 0 predicate places. [2024-11-12 12:40:49,180 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 451 transitions, 1578 flow [2024-11-12 12:40:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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-11-12 12:40:49,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:49,182 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:49,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 12:40:49,183 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1116933197, now seen corresponding path program 1 times [2024-11-12 12:40:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207273663] [2024-11-12 12:40:49,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-12 12:40:50,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207273663] [2024-11-12 12:40:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207273663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208368154] [2024-11-12 12:40:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:50,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:50,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-11-12 12:40:50,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 451 transitions, 1578 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-11-12 12:40:50,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:50,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-11-12 12:40:50,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:54,339 INFO L124 PetriNetUnfolderBase]: 4780/18262 cut-off events. [2024-11-12 12:40:54,340 INFO L125 PetriNetUnfolderBase]: For 20740/21095 co-relation queries the response was YES. [2024-11-12 12:40:54,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39090 conditions, 18262 events. 4780/18262 cut-off events. For 20740/21095 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 211141 event pairs, 781 based on Foata normal form. 266/17189 useless extension candidates. Maximal degree in co-relation 39036. Up to 3538 conditions per place. [2024-11-12 12:40:54,497 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 76 selfloop transitions, 32 changer transitions 0/496 dead transitions. [2024-11-12 12:40:54,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 496 transitions, 2015 flow [2024-11-12 12:40:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-11-12 12:40:54,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-11-12 12:40:54,501 INFO L175 Difference]: Start difference. First operand has 449 places, 451 transitions, 1578 flow. Second operand 6 states and 2703 transitions. [2024-11-12 12:40:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 496 transitions, 2015 flow [2024-11-12 12:40:54,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 496 transitions, 1940 flow, removed 12 selfloop flow, removed 26 redundant places. [2024-11-12 12:40:54,529 INFO L231 Difference]: Finished difference. Result has 433 places, 477 transitions, 1844 flow [2024-11-12 12:40:54,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1844, PETRI_PLACES=433, PETRI_TRANSITIONS=477} [2024-11-12 12:40:54,530 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -16 predicate places. [2024-11-12 12:40:54,531 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 477 transitions, 1844 flow [2024-11-12 12:40:54,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-11-12 12:40:54,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:54,532 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:54,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 12:40:54,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:54,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1489406644, now seen corresponding path program 1 times [2024-11-12 12:40:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639697706] [2024-11-12 12:40:54,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-12 12:40:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639697706] [2024-11-12 12:40:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639697706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724223388] [2024-11-12 12:40:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:54,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:54,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-12 12:40:54,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 477 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-11-12 12:40:54,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:54,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-12 12:40:54,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:57,799 INFO L124 PetriNetUnfolderBase]: 3185/14336 cut-off events. [2024-11-12 12:40:57,800 INFO L125 PetriNetUnfolderBase]: For 27853/28469 co-relation queries the response was YES. [2024-11-12 12:40:57,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32599 conditions, 14336 events. 3185/14336 cut-off events. For 27853/28469 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 165963 event pairs, 917 based on Foata normal form. 131/13054 useless extension candidates. Maximal degree in co-relation 32542. Up to 2701 conditions per place. [2024-11-12 12:40:57,934 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 49 selfloop transitions, 2 changer transitions 0/483 dead transitions. [2024-11-12 12:40:57,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 483 transitions, 1986 flow [2024-11-12 12:40:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-12 12:40:57,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-12 12:40:57,935 INFO L175 Difference]: Start difference. First operand has 433 places, 477 transitions, 1844 flow. Second operand 3 states and 1398 transitions. [2024-11-12 12:40:57,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 483 transitions, 1986 flow [2024-11-12 12:40:57,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 483 transitions, 1970 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:57,974 INFO L231 Difference]: Finished difference. Result has 434 places, 476 transitions, 1830 flow [2024-11-12 12:40:57,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1830, PETRI_PLACES=434, PETRI_TRANSITIONS=476} [2024-11-12 12:40:57,975 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -15 predicate places. [2024-11-12 12:40:57,975 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 476 transitions, 1830 flow [2024-11-12 12:40:57,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-11-12 12:40:57,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:57,976 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:40:57,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 12:40:57,977 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:40:57,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -851236923, now seen corresponding path program 1 times [2024-11-12 12:40:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950936808] [2024-11-12 12:40:57,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 12:40:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950936808] [2024-11-12 12:40:58,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950936808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988760456] [2024-11-12 12:40:58,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:58,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:40:58,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 12:40:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:58,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 12:40:58,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 12:40:59,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:40:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 12:40:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988760456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:40:59,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:40:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-11-12 12:40:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565428401] [2024-11-12 12:40:59,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:40:59,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 12:40:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:59,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 12:40:59,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-11-12 12:41:01,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 510 [2024-11-12 12:41:01,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 476 transitions, 1830 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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-11-12 12:41:01,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:41:01,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 510 [2024-11-12 12:41:01,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:41:08,851 INFO L124 PetriNetUnfolderBase]: 7157/29496 cut-off events. [2024-11-12 12:41:08,852 INFO L125 PetriNetUnfolderBase]: For 45030/51021 co-relation queries the response was YES. [2024-11-12 12:41:09,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66911 conditions, 29496 events. 7157/29496 cut-off events. For 45030/51021 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 359164 event pairs, 2138 based on Foata normal form. 662/28311 useless extension candidates. Maximal degree in co-relation 66851. Up to 6149 conditions per place. [2024-11-12 12:41:09,251 INFO L140 encePairwiseOnDemand]: 468/510 looper letters, 130 selfloop transitions, 115 changer transitions 0/611 dead transitions. [2024-11-12 12:41:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 611 transitions, 3025 flow [2024-11-12 12:41:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 12:41:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-12 12:41:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2024-11-12 12:41:09,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8394463667820069 [2024-11-12 12:41:09,260 INFO L175 Difference]: Start difference. First operand has 434 places, 476 transitions, 1830 flow. Second operand 34 states and 14556 transitions. [2024-11-12 12:41:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 611 transitions, 3025 flow [2024-11-12 12:41:09,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 611 transitions, 3021 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:41:09,329 INFO L231 Difference]: Finished difference. Result has 475 places, 554 transitions, 2560 flow [2024-11-12 12:41:09,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2560, PETRI_PLACES=475, PETRI_TRANSITIONS=554} [2024-11-12 12:41:09,330 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 26 predicate places. [2024-11-12 12:41:09,330 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 554 transitions, 2560 flow [2024-11-12 12:41:09,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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-11-12 12:41:09,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:41:09,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:41:09,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 12:41:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-12 12:41:09,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:41:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:41:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1975076787, now seen corresponding path program 1 times [2024-11-12 12:41:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:41:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300486380] [2024-11-12 12:41:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:41:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:41:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:41:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 12:41:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:41:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300486380] [2024-11-12 12:41:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300486380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:41:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125478086] [2024-11-12 12:41:10,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:41:10,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:41:10,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:41:10,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:41:10,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 12:41:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:41:11,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 12:41:11,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:41:11,078 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-11-12 12:41:11,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:41:11,160 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-11-12 12:41:11,507 INFO L349 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2024-11-12 12:41:11,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 123 [2024-11-12 12:41:11,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-11-12 12:41:11,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-11-12 12:41:11,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-11-12 12:41:11,717 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 0 case distinctions, treesize of input 57 treesize of output 34 [2024-11-12 12:41:11,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 12:41:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 12:41:11,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:41:11,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 132 [2024-11-12 12:41:11,863 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 43 treesize of output 36 [2024-11-12 12:41:11,866 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 98 treesize of output 84 [2024-11-12 12:41:11,870 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 37 treesize of output 30 [2024-11-12 12:41:11,895 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:11,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 92 [2024-11-12 12:41:11,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:11,902 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 19 treesize of output 12 [2024-11-12 12:41:11,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:11,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 92 [2024-11-12 12:41:11,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:11,912 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 19 treesize of output 12 [2024-11-12 12:41:11,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 92 treesize of output 90 [2024-11-12 12:41:11,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:11,922 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 18 treesize of output 12 [2024-11-12 12:41:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 12:41:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125478086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:41:12,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:41:12,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-12 12:41:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795384350] [2024-11-12 12:41:12,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:41:12,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 12:41:12,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:41:12,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 12:41:12,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-12 12:41:15,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-11-12 12:41:15,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 554 transitions, 2560 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-11-12 12:41:15,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:41:15,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-11-12 12:41:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:41:24,499 INFO L124 PetriNetUnfolderBase]: 7172/33551 cut-off events. [2024-11-12 12:41:24,500 INFO L125 PetriNetUnfolderBase]: For 64670/67162 co-relation queries the response was YES. [2024-11-12 12:41:24,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84446 conditions, 33551 events. 7172/33551 cut-off events. For 64670/67162 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 422506 event pairs, 999 based on Foata normal form. 1036/32959 useless extension candidates. Maximal degree in co-relation 84372. Up to 3307 conditions per place. [2024-11-12 12:41:25,174 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 163 selfloop transitions, 72 changer transitions 0/654 dead transitions. [2024-11-12 12:41:25,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 654 transitions, 3821 flow [2024-11-12 12:41:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 12:41:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-12 12:41:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10480 transitions. [2024-11-12 12:41:25,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8219607843137255 [2024-11-12 12:41:25,182 INFO L175 Difference]: Start difference. First operand has 475 places, 554 transitions, 2560 flow. Second operand 25 states and 10480 transitions. [2024-11-12 12:41:25,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 654 transitions, 3821 flow [2024-11-12 12:41:25,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 654 transitions, 3737 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-11-12 12:41:25,349 INFO L231 Difference]: Finished difference. Result has 499 places, 568 transitions, 2863 flow [2024-11-12 12:41:25,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2472, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2863, PETRI_PLACES=499, PETRI_TRANSITIONS=568} [2024-11-12 12:41:25,350 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 50 predicate places. [2024-11-12 12:41:25,351 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 568 transitions, 2863 flow [2024-11-12 12:41:25,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-11-12 12:41:25,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:41:25,352 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:41:25,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 12:41:25,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:41:25,553 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:41:25,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:41:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1194086323, now seen corresponding path program 2 times [2024-11-12 12:41:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:41:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138423770] [2024-11-12 12:41:25,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:41:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:41:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:41:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 12:41:26,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:41:26,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138423770] [2024-11-12 12:41:26,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138423770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:41:26,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374249458] [2024-11-12 12:41:26,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:41:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:41:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:41:26,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:41:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 12:41:27,082 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:41:27,082 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:41:27,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 12:41:27,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:41:27,097 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-11-12 12:41:27,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:41:27,163 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-11-12 12:41:27,441 INFO L349 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2024-11-12 12:41:27,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 123 [2024-11-12 12:41:27,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-11-12 12:41:27,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-11-12 12:41:27,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-11-12 12:41:27,585 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 0 case distinctions, treesize of input 57 treesize of output 34 [2024-11-12 12:41:27,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 12:41:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 12:41:27,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:41:27,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 132 [2024-11-12 12:41:27,673 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 44 treesize of output 37 [2024-11-12 12:41:27,677 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 98 treesize of output 84 [2024-11-12 12:41:27,680 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 36 treesize of output 29 [2024-11-12 12:41:27,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 92 [2024-11-12 12:41:27,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,700 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 19 treesize of output 12 [2024-11-12 12:41:27,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 92 treesize of output 90 [2024-11-12 12:41:27,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,708 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 18 treesize of output 12 [2024-11-12 12:41:27,710 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 92 [2024-11-12 12:41:27,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,716 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 19 treesize of output 12 [2024-11-12 12:41:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 12:41:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374249458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:41:28,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:41:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-12 12:41:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904674022] [2024-11-12 12:41:28,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:41:28,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 12:41:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:41:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 12:41:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-12 12:41:31,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-11-12 12:41:31,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 568 transitions, 2863 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-11-12 12:41:31,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:41:31,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-11-12 12:41:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:41:39,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][610], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 14#L50-8true, Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 548#true, 522#(= |#race~A~0| 0), Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, 576#true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2472#true, 8932#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:39,126 INFO L294 olderBase$Statistics]: this new event has 427 ancestors and is cut-off event [2024-11-12 12:41:39,126 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-11-12 12:41:39,126 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2024-11-12 12:41:39,126 INFO L297 olderBase$Statistics]: existing Event has 413 ancestors and is cut-off event [2024-11-12 12:41:39,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][619], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 333#L52-5true, 287#L65true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2472#true, 8932#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:39,930 INFO L294 olderBase$Statistics]: this new event has 439 ancestors and is cut-off event [2024-11-12 12:41:39,930 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is cut-off event [2024-11-12 12:41:39,931 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2024-11-12 12:41:39,931 INFO L297 olderBase$Statistics]: existing Event has 425 ancestors and is cut-off event [2024-11-12 12:41:40,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][625], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 254#L52-6true, 2472#true, 8932#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:40,002 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is cut-off event [2024-11-12 12:41:40,002 INFO L297 olderBase$Statistics]: existing Event has 426 ancestors and is cut-off event [2024-11-12 12:41:40,002 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is cut-off event [2024-11-12 12:41:40,002 INFO L297 olderBase$Statistics]: existing Event has 433 ancestors and is cut-off event [2024-11-12 12:41:40,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][629], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 328#L52-7true, 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2472#true, 8932#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:40,080 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-11-12 12:41:40,080 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-11-12 12:41:40,080 INFO L297 olderBase$Statistics]: existing Event has 434 ancestors and is cut-off event [2024-11-12 12:41:40,080 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2024-11-12 12:41:40,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2472#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 71#L52-9true, 363#L68true, 8942#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:40,147 INFO L294 olderBase$Statistics]: this new event has 443 ancestors and is cut-off event [2024-11-12 12:41:40,147 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2024-11-12 12:41:40,147 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2024-11-12 12:41:40,147 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-11-12 12:41:40,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2472#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 437#L61-6true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 71#L52-9true, 8942#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:40,148 INFO L294 olderBase$Statistics]: this new event has 438 ancestors and is cut-off event [2024-11-12 12:41:40,148 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-12 12:41:40,148 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is cut-off event [2024-11-12 12:41:40,148 INFO L297 olderBase$Statistics]: existing Event has 438 ancestors and is cut-off event [2024-11-12 12:41:40,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][633], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 451#L52-8true, Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6777#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6785#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6783#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6781#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, 6779#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2472#true, 8932#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-12 12:41:40,149 INFO L294 olderBase$Statistics]: this new event has 442 ancestors and is cut-off event [2024-11-12 12:41:40,149 INFO L297 olderBase$Statistics]: existing Event has 442 ancestors and is cut-off event [2024-11-12 12:41:40,149 INFO L297 olderBase$Statistics]: existing Event has 428 ancestors and is cut-off event [2024-11-12 12:41:40,149 INFO L297 olderBase$Statistics]: existing Event has 435 ancestors and is cut-off event [2024-11-12 12:41:41,541 INFO L124 PetriNetUnfolderBase]: 8794/39897 cut-off events. [2024-11-12 12:41:41,542 INFO L125 PetriNetUnfolderBase]: For 106150/109276 co-relation queries the response was YES. [2024-11-12 12:41:41,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101302 conditions, 39897 events. 8794/39897 cut-off events. For 106150/109276 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 520757 event pairs, 1059 based on Foata normal form. 1403/38647 useless extension candidates. Maximal degree in co-relation 101222. Up to 4924 conditions per place. [2024-11-12 12:41:42,140 INFO L140 encePairwiseOnDemand]: 479/510 looper letters, 126 selfloop transitions, 110 changer transitions 0/655 dead transitions. [2024-11-12 12:41:42,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 655 transitions, 4063 flow [2024-11-12 12:41:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 12:41:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-12 12:41:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 10898 transitions. [2024-11-12 12:41:42,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8218702865761689 [2024-11-12 12:41:42,148 INFO L175 Difference]: Start difference. First operand has 499 places, 568 transitions, 2863 flow. Second operand 26 states and 10898 transitions. [2024-11-12 12:41:42,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 655 transitions, 4063 flow [2024-11-12 12:41:42,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 655 transitions, 3986 flow, removed 13 selfloop flow, removed 18 redundant places. [2024-11-12 12:41:42,541 INFO L231 Difference]: Finished difference. Result has 510 places, 597 transitions, 3469 flow [2024-11-12 12:41:42,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2798, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3469, PETRI_PLACES=510, PETRI_TRANSITIONS=597} [2024-11-12 12:41:42,542 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 61 predicate places. [2024-11-12 12:41:42,542 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 597 transitions, 3469 flow [2024-11-12 12:41:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-11-12 12:41:42,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:41:42,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:41:42,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 12:41:42,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-12 12:41:42,749 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-12 12:41:42,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:41:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 664047267, now seen corresponding path program 1 times [2024-11-12 12:41:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:41:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108029358] [2024-11-12 12:41:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:41:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:41:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:41:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-12 12:41:42,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:41:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108029358] [2024-11-12 12:41:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108029358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:41:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:41:42,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:41:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195274499] [2024-11-12 12:41:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:41:42,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:41:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:41:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:41:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:41:42,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-12 12:41:42,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 597 transitions, 3469 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-11-12 12:41:42,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:41:42,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-12 12:41:42,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand