./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:31:41,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:31:41,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:31:41,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:31:41,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:31:41,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:31:41,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:31:41,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:31:41,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:31:41,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:31:41,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:31:41,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:31:41,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:31:41,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:31:41,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:31:41,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:31:41,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:31:41,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:31:41,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:31:41,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:31:41,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:31:41,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:31:41,437 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:31:41,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:31:41,437 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:31:41,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:31:41,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:31:41,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:31:41,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:31:41,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:31:41,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:31:41,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:31:41,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:31:41,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:31:41,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:31:41,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:31:41,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:31:41,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:31:41,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:31:41,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:31:41,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:31:41,444 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2024-10-24 15:31:41,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:31:41,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:31:41,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:31:41,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:31:41,735 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:31:41,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-10-24 15:31:43,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:31:43,405 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:31:43,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-10-24 15:31:43,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f2022af/f1a4279aa59a45f9b5c301bc7bfc55c1/FLAGf2c82ddc3 [2024-10-24 15:31:43,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f2022af/f1a4279aa59a45f9b5c301bc7bfc55c1 [2024-10-24 15:31:43,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:31:43,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:31:43,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:31:43,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:31:43,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:31:43,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91bc3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43, skipping insertion in model container [2024-10-24 15:31:43,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:31:43,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:31:43,732 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:31:43,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:31:43,811 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:31:43,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43 WrapperNode [2024-10-24 15:31:43,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:31:43,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:31:43,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:31:43,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:31:43,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,863 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 248 [2024-10-24 15:31:43,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:31:43,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:31:43,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:31:43,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:31:43,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:31:43,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:31:43,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:31:43,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:31:43,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (1/1) ... [2024-10-24 15:31:43,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:31:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:31:44,012 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-10-24 15:31:44,015 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-10-24 15:31:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:31:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 15:31:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 15:31:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 15:31:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 15:31:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 15:31:44,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 15:31:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:31:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-24 15:31:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:31:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:31:44,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:31:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-24 15:31:44,074 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:31:44,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:31:44,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:31:45,009 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:31:45,009 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:31:45,042 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:31:45,042 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-24 15:31:45,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:45 BoogieIcfgContainer [2024-10-24 15:31:45,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:31:45,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:31:45,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:31:45,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:31:45,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:31:43" (1/3) ... [2024-10-24 15:31:45,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60835c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:31:45, skipping insertion in model container [2024-10-24 15:31:45,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:43" (2/3) ... [2024-10-24 15:31:45,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60835c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:31:45, skipping insertion in model container [2024-10-24 15:31:45,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:45" (3/3) ... [2024-10-24 15:31:45,052 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-10-24 15:31:45,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:31:45,073 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-10-24 15:31:45,073 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:31:45,238 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-24 15:31:45,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 655 transitions, 1331 flow [2024-10-24 15:31:45,552 INFO L124 PetriNetUnfolderBase]: 33/652 cut-off events. [2024-10-24 15:31:45,553 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:31:45,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 652 events. 33/652 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1718 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2024-10-24 15:31:45,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 632 places, 655 transitions, 1331 flow [2024-10-24 15:31:45,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 632 transitions, 1282 flow [2024-10-24 15:31:45,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:31:45,615 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;@a24032b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:31:45,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-10-24 15:31:45,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:31:45,620 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-24 15:31:45,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:31:45,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:45,621 INFO L204 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-10-24 15:31:45,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:45,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash 452336704, now seen corresponding path program 1 times [2024-10-24 15:31:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815168335] [2024-10-24 15:31:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815168335] [2024-10-24 15:31:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815168335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:45,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:45,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572704557] [2024-10-24 15:31:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:45,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:45,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-24 15:31:45,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 632 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:45,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:45,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-24 15:31:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:46,307 INFO L124 PetriNetUnfolderBase]: 78/1518 cut-off events. [2024-10-24 15:31:46,307 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-24 15:31:46,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1518 events. 78/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9253 event pairs, 20 based on Foata normal form. 30/1249 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2024-10-24 15:31:46,409 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 13 selfloop transitions, 2 changer transitions 7/618 dead transitions. [2024-10-24 15:31:46,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 618 transitions, 1284 flow [2024-10-24 15:31:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-10-24 15:31:46,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659033078880407 [2024-10-24 15:31:46,438 INFO L175 Difference]: Start difference. First operand has 611 places, 632 transitions, 1282 flow. Second operand 3 states and 1898 transitions. [2024-10-24 15:31:46,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 618 transitions, 1284 flow [2024-10-24 15:31:46,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 618 transitions, 1272 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 15:31:46,455 INFO L231 Difference]: Finished difference. Result has 606 places, 611 transitions, 1232 flow [2024-10-24 15:31:46,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=606, PETRI_TRANSITIONS=611} [2024-10-24 15:31:46,461 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2024-10-24 15:31:46,462 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 611 transitions, 1232 flow [2024-10-24 15:31:46,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:46,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:46,464 INFO L204 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] [2024-10-24 15:31:46,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:31:46,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2119054710, now seen corresponding path program 1 times [2024-10-24 15:31:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782919175] [2024-10-24 15:31:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:46,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:46,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782919175] [2024-10-24 15:31:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782919175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:46,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041449093] [2024-10-24 15:31:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:46,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:46,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-24 15:31:46,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:46,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:46,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-24 15:31:46,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:46,801 INFO L124 PetriNetUnfolderBase]: 50/1054 cut-off events. [2024-10-24 15:31:46,801 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:31:46,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1054 events. 50/1054 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5195 event pairs, 12 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1068. Up to 38 conditions per place. [2024-10-24 15:31:46,831 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2024-10-24 15:31:46,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1260 flow [2024-10-24 15:31:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-24 15:31:46,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-24 15:31:46,836 INFO L175 Difference]: Start difference. First operand has 606 places, 611 transitions, 1232 flow. Second operand 3 states and 1885 transitions. [2024-10-24 15:31:46,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1260 flow [2024-10-24 15:31:46,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:46,889 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2024-10-24 15:31:46,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2024-10-24 15:31:46,891 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2024-10-24 15:31:46,891 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2024-10-24 15:31:46,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:46,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:46,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:31:46,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:31:46,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:46,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1745260268, now seen corresponding path program 1 times [2024-10-24 15:31:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946171657] [2024-10-24 15:31:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946171657] [2024-10-24 15:31:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946171657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:46,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:46,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440395528] [2024-10-24 15:31:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:46,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:46,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:46,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-24 15:31:46,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:46,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:46,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-24 15:31:46,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:47,287 INFO L124 PetriNetUnfolderBase]: 78/1485 cut-off events. [2024-10-24 15:31:47,288 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-24 15:31:47,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1485 events. 78/1485 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8424 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1501. Up to 50 conditions per place. [2024-10-24 15:31:47,314 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-10-24 15:31:47,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1258 flow [2024-10-24 15:31:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-24 15:31:47,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-24 15:31:47,322 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1885 transitions. [2024-10-24 15:31:47,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1258 flow [2024-10-24 15:31:47,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:47,333 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2024-10-24 15:31:47,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2024-10-24 15:31:47,335 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-10-24 15:31:47,335 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2024-10-24 15:31:47,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:47,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:47,338 INFO L204 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] [2024-10-24 15:31:47,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:31:47,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:47,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1138626604, now seen corresponding path program 1 times [2024-10-24 15:31:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298096102] [2024-10-24 15:31:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:47,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298096102] [2024-10-24 15:31:47,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298096102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:47,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739476963] [2024-10-24 15:31:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:47,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:47,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:47,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-10-24 15:31:47,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-24 15:31:47,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:47,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-10-24 15:31:47,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:47,810 INFO L124 PetriNetUnfolderBase]: 88/1786 cut-off events. [2024-10-24 15:31:47,810 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:31:47,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1786 events. 88/1786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11593 event pairs, 20 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1803. Up to 51 conditions per place. [2024-10-24 15:31:47,848 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2024-10-24 15:31:47,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1258 flow [2024-10-24 15:31:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-10-24 15:31:47,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-10-24 15:31:47,853 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1883 transitions. [2024-10-24 15:31:47,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1258 flow [2024-10-24 15:31:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:47,862 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1226 flow [2024-10-24 15:31:47,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2024-10-24 15:31:47,864 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -15 predicate places. [2024-10-24 15:31:47,864 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1226 flow [2024-10-24 15:31:47,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-24 15:31:47,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:47,866 INFO L204 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] [2024-10-24 15:31:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:31:47,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -392882240, now seen corresponding path program 1 times [2024-10-24 15:31:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690555233] [2024-10-24 15:31:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690555233] [2024-10-24 15:31:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690555233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470457634] [2024-10-24 15:31:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:47,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:47,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-10-24 15:31:47,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-24 15:31:47,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:47,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-10-24 15:31:47,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:48,139 INFO L124 PetriNetUnfolderBase]: 50/1089 cut-off events. [2024-10-24 15:31:48,139 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-24 15:31:48,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 1089 events. 50/1089 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5540 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1080. Up to 39 conditions per place. [2024-10-24 15:31:48,166 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2024-10-24 15:31:48,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1256 flow [2024-10-24 15:31:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-10-24 15:31:48,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-10-24 15:31:48,171 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1226 flow. Second operand 3 states and 1883 transitions. [2024-10-24 15:31:48,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1256 flow [2024-10-24 15:31:48,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:48,180 INFO L231 Difference]: Finished difference. Result has 595 places, 607 transitions, 1224 flow [2024-10-24 15:31:48,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=595, PETRI_TRANSITIONS=607} [2024-10-24 15:31:48,182 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2024-10-24 15:31:48,182 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 607 transitions, 1224 flow [2024-10-24 15:31:48,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-24 15:31:48,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:48,184 INFO L204 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] [2024-10-24 15:31:48,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:31:48,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:48,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1194727645, now seen corresponding path program 1 times [2024-10-24 15:31:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571358981] [2024-10-24 15:31:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571358981] [2024-10-24 15:31:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571358981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858430402] [2024-10-24 15:31:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:48,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:48,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:48,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-10-24 15:31:48,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 607 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-24 15:31:48,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:48,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-10-24 15:31:48,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:48,431 INFO L124 PetriNetUnfolderBase]: 48/866 cut-off events. [2024-10-24 15:31:48,432 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-24 15:31:48,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 866 events. 48/866 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3777 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 859. Up to 51 conditions per place. [2024-10-24 15:31:48,454 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-10-24 15:31:48,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1254 flow [2024-10-24 15:31:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-10-24 15:31:48,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-10-24 15:31:48,460 INFO L175 Difference]: Start difference. First operand has 595 places, 607 transitions, 1224 flow. Second operand 3 states and 1883 transitions. [2024-10-24 15:31:48,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1254 flow [2024-10-24 15:31:48,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:48,469 INFO L231 Difference]: Finished difference. Result has 594 places, 606 transitions, 1222 flow [2024-10-24 15:31:48,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2024-10-24 15:31:48,472 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2024-10-24 15:31:48,472 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1222 flow [2024-10-24 15:31:48,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-24 15:31:48,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:48,474 INFO L204 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] [2024-10-24 15:31:48,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:31:48,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -420121175, now seen corresponding path program 1 times [2024-10-24 15:31:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962270478] [2024-10-24 15:31:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962270478] [2024-10-24 15:31:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962270478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:48,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:48,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774254863] [2024-10-24 15:31:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:48,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:48,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:48,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:48,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-10-24 15:31:48,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-24 15:31:48,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:48,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-10-24 15:31:48,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:48,922 INFO L124 PetriNetUnfolderBase]: 165/2324 cut-off events. [2024-10-24 15:31:48,922 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2024-10-24 15:31:48,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 2324 events. 165/2324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17869 event pairs, 64 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2435. Up to 151 conditions per place. [2024-10-24 15:31:48,970 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2024-10-24 15:31:48,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 601 transitions, 1246 flow [2024-10-24 15:31:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-10-24 15:31:48,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-10-24 15:31:48,975 INFO L175 Difference]: Start difference. First operand has 594 places, 606 transitions, 1222 flow. Second operand 3 states and 1876 transitions. [2024-10-24 15:31:48,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 601 transitions, 1246 flow [2024-10-24 15:31:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 601 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:48,984 INFO L231 Difference]: Finished difference. Result has 589 places, 601 transitions, 1210 flow [2024-10-24 15:31:48,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=589, PETRI_TRANSITIONS=601} [2024-10-24 15:31:48,985 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-10-24 15:31:48,985 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 601 transitions, 1210 flow [2024-10-24 15:31:48,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-24 15:31:48,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:48,987 INFO L204 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] [2024-10-24 15:31:48,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:31:48,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:48,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 237991042, now seen corresponding path program 1 times [2024-10-24 15:31:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123352285] [2024-10-24 15:31:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:48,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:49,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123352285] [2024-10-24 15:31:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123352285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:49,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:49,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:49,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387849011] [2024-10-24 15:31:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:49,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:49,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:49,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-24 15:31:49,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:49,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:49,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-24 15:31:49,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:49,380 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2024-10-24 15:31:49,381 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-24 15:31:49,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10573 event pairs, 20 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2024-10-24 15:31:49,414 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-10-24 15:31:49,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 600 transitions, 1238 flow [2024-10-24 15:31:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-24 15:31:49,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-24 15:31:49,419 INFO L175 Difference]: Start difference. First operand has 589 places, 601 transitions, 1210 flow. Second operand 3 states and 1885 transitions. [2024-10-24 15:31:49,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 600 transitions, 1238 flow [2024-10-24 15:31:49,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:49,427 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2024-10-24 15:31:49,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2024-10-24 15:31:49,430 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-10-24 15:31:49,430 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2024-10-24 15:31:49,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:49,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:49,432 INFO L204 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] [2024-10-24 15:31:49,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:31:49,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:49,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash 233819493, now seen corresponding path program 1 times [2024-10-24 15:31:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885080105] [2024-10-24 15:31:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:49,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885080105] [2024-10-24 15:31:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885080105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:31:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501072305] [2024-10-24 15:31:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:31:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:31:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:31:50,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 655 [2024-10-24 15:31:50,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-10-24 15:31:50,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 655 [2024-10-24 15:31:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:58,687 INFO L124 PetriNetUnfolderBase]: 12845/49235 cut-off events. [2024-10-24 15:31:58,689 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-10-24 15:31:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66718 conditions, 49235 events. 12845/49235 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 647538 event pairs, 10080 based on Foata normal form. 0/40940 useless extension candidates. Maximal degree in co-relation 66642. Up to 17156 conditions per place. [2024-10-24 15:31:59,217 INFO L140 encePairwiseOnDemand]: 637/655 looper letters, 78 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2024-10-24 15:31:59,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1391 flow [2024-10-24 15:31:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:31:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:31:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3360 transitions. [2024-10-24 15:31:59,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8549618320610687 [2024-10-24 15:31:59,225 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 6 states and 3360 transitions. [2024-10-24 15:31:59,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1391 flow [2024-10-24 15:31:59,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:59,236 INFO L231 Difference]: Finished difference. Result has 589 places, 597 transitions, 1231 flow [2024-10-24 15:31:59,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1231, PETRI_PLACES=589, PETRI_TRANSITIONS=597} [2024-10-24 15:31:59,238 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-10-24 15:31:59,238 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1231 flow [2024-10-24 15:31:59,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-10-24 15:31:59,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:59,240 INFO L204 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] [2024-10-24 15:31:59,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:31:59,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:59,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash -895861133, now seen corresponding path program 1 times [2024-10-24 15:31:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:59,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578861649] [2024-10-24 15:31:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578861649] [2024-10-24 15:31:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578861649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:59,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:59,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792001226] [2024-10-24 15:31:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:59,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:59,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-10-24 15:31:59,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-24 15:31:59,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:59,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-10-24 15:31:59,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:59,837 INFO L124 PetriNetUnfolderBase]: 113/1699 cut-off events. [2024-10-24 15:31:59,838 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-10-24 15:31:59,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1699 events. 113/1699 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11076 event pairs, 32 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 1784. Up to 102 conditions per place. [2024-10-24 15:31:59,882 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2024-10-24 15:31:59,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 592 transitions, 1255 flow [2024-10-24 15:31:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-10-24 15:31:59,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-10-24 15:31:59,888 INFO L175 Difference]: Start difference. First operand has 589 places, 597 transitions, 1231 flow. Second operand 3 states and 1876 transitions. [2024-10-24 15:31:59,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 592 transitions, 1255 flow [2024-10-24 15:31:59,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 592 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:31:59,898 INFO L231 Difference]: Finished difference. Result has 581 places, 592 transitions, 1193 flow [2024-10-24 15:31:59,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=581, PETRI_TRANSITIONS=592} [2024-10-24 15:31:59,901 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-10-24 15:31:59,901 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 592 transitions, 1193 flow [2024-10-24 15:31:59,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-24 15:31:59,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:59,903 INFO L204 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] [2024-10-24 15:31:59,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:31:59,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:31:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -467743023, now seen corresponding path program 1 times [2024-10-24 15:31:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709565689] [2024-10-24 15:31:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709565689] [2024-10-24 15:31:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709565689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:59,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421211381] [2024-10-24 15:31:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:59,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-24 15:31:59,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 592 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:31:59,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:59,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-24 15:31:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:00,211 INFO L124 PetriNetUnfolderBase]: 50/1065 cut-off events. [2024-10-24 15:32:00,211 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-24 15:32:00,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1065 events. 50/1065 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4830 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-10-24 15:32:00,232 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2024-10-24 15:32:00,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 591 transitions, 1221 flow [2024-10-24 15:32:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-24 15:32:00,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-24 15:32:00,238 INFO L175 Difference]: Start difference. First operand has 581 places, 592 transitions, 1193 flow. Second operand 3 states and 1885 transitions. [2024-10-24 15:32:00,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 591 transitions, 1221 flow [2024-10-24 15:32:00,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:00,249 INFO L231 Difference]: Finished difference. Result has 581 places, 591 transitions, 1194 flow [2024-10-24 15:32:00,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=581, PETRI_TRANSITIONS=591} [2024-10-24 15:32:00,251 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-10-24 15:32:00,251 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 591 transitions, 1194 flow [2024-10-24 15:32:00,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:32:00,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:00,252 INFO L204 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-10-24 15:32:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:32:00,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:00,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 164645723, now seen corresponding path program 1 times [2024-10-24 15:32:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:00,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972336814] [2024-10-24 15:32:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972336814] [2024-10-24 15:32:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972336814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:00,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:00,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306248264] [2024-10-24 15:32:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:00,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:00,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:00,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-10-24 15:32:00,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 591 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-24 15:32:00,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:00,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-10-24 15:32:00,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:00,746 INFO L124 PetriNetUnfolderBase]: 166/1874 cut-off events. [2024-10-24 15:32:00,746 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-10-24 15:32:00,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1874 events. 166/1874 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12465 event pairs, 64 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1981. Up to 169 conditions per place. [2024-10-24 15:32:00,768 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2024-10-24 15:32:00,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 586 transitions, 1218 flow [2024-10-24 15:32:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-10-24 15:32:00,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-10-24 15:32:00,773 INFO L175 Difference]: Start difference. First operand has 581 places, 591 transitions, 1194 flow. Second operand 3 states and 1876 transitions. [2024-10-24 15:32:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 586 transitions, 1218 flow [2024-10-24 15:32:00,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 586 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:00,781 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1182 flow [2024-10-24 15:32:00,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2024-10-24 15:32:00,782 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-10-24 15:32:00,783 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1182 flow [2024-10-24 15:32:00,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-24 15:32:00,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:00,784 INFO L204 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] [2024-10-24 15:32:00,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:32:00,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1782534799, now seen corresponding path program 1 times [2024-10-24 15:32:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:00,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452005082] [2024-10-24 15:32:00,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:00,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452005082] [2024-10-24 15:32:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452005082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:00,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:00,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814603685] [2024-10-24 15:32:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:00,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:00,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-24 15:32:00,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:32:00,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:00,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-24 15:32:00,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:01,007 INFO L124 PetriNetUnfolderBase]: 48/837 cut-off events. [2024-10-24 15:32:01,008 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-24 15:32:01,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 48/837 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3270 event pairs, 20 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-10-24 15:32:01,024 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-24 15:32:01,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 585 transitions, 1210 flow [2024-10-24 15:32:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-24 15:32:01,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-24 15:32:01,029 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1182 flow. Second operand 3 states and 1885 transitions. [2024-10-24 15:32:01,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 585 transitions, 1210 flow [2024-10-24 15:32:01,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 585 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:01,038 INFO L231 Difference]: Finished difference. Result has 576 places, 585 transitions, 1183 flow [2024-10-24 15:32:01,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2024-10-24 15:32:01,039 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-10-24 15:32:01,039 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1183 flow [2024-10-24 15:32:01,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-24 15:32:01,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:01,041 INFO L204 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] [2024-10-24 15:32:01,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:32:01,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash 286688870, now seen corresponding path program 1 times [2024-10-24 15:32:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307492072] [2024-10-24 15:32:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307492072] [2024-10-24 15:32:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307492072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612006513] [2024-10-24 15:32:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:01,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:01,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-24 15:32:01,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-24 15:32:01,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:01,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-24 15:32:01,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:01,358 INFO L124 PetriNetUnfolderBase]: 157/2220 cut-off events. [2024-10-24 15:32:01,358 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-24 15:32:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 2220 events. 157/2220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16956 event pairs, 53 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2024-10-24 15:32:01,385 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-24 15:32:01,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1223 flow [2024-10-24 15:32:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-10-24 15:32:01,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-10-24 15:32:01,390 INFO L175 Difference]: Start difference. First operand has 576 places, 585 transitions, 1183 flow. Second operand 3 states and 1886 transitions. [2024-10-24 15:32:01,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 585 transitions, 1223 flow [2024-10-24 15:32:01,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:01,403 INFO L231 Difference]: Finished difference. Result has 573 places, 583 transitions, 1185 flow [2024-10-24 15:32:01,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=573, PETRI_TRANSITIONS=583} [2024-10-24 15:32:01,404 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -38 predicate places. [2024-10-24 15:32:01,405 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 583 transitions, 1185 flow [2024-10-24 15:32:01,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-24 15:32:01,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:01,406 INFO L204 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] [2024-10-24 15:32:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:32:01,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 630144488, now seen corresponding path program 1 times [2024-10-24 15:32:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:01,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601312288] [2024-10-24 15:32:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601312288] [2024-10-24 15:32:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601312288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:01,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444285971] [2024-10-24 15:32:01,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:01,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:01,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:01,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-24 15:32:01,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 583 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-24 15:32:01,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:01,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-24 15:32:01,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:01,833 INFO L124 PetriNetUnfolderBase]: 96/1534 cut-off events. [2024-10-24 15:32:01,833 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-24 15:32:01,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1534 events. 96/1534 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9615 event pairs, 20 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1559. Up to 75 conditions per place. [2024-10-24 15:32:01,874 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-10-24 15:32:01,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 583 transitions, 1225 flow [2024-10-24 15:32:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-10-24 15:32:01,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-10-24 15:32:01,879 INFO L175 Difference]: Start difference. First operand has 573 places, 583 transitions, 1185 flow. Second operand 3 states and 1886 transitions. [2024-10-24 15:32:01,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 583 transitions, 1225 flow [2024-10-24 15:32:01,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 583 transitions, 1225 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:01,890 INFO L231 Difference]: Finished difference. Result has 572 places, 581 transitions, 1191 flow [2024-10-24 15:32:01,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2024-10-24 15:32:01,891 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-10-24 15:32:01,891 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1191 flow [2024-10-24 15:32:01,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-24 15:32:01,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:01,893 INFO L204 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] [2024-10-24 15:32:01,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:32:01,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash -69708871, now seen corresponding path program 1 times [2024-10-24 15:32:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:01,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118061070] [2024-10-24 15:32:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118061070] [2024-10-24 15:32:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118061070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:01,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789871779] [2024-10-24 15:32:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:01,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-24 15:32:01,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-10-24 15:32:01,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:01,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-24 15:32:01,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:02,524 INFO L124 PetriNetUnfolderBase]: 250/3267 cut-off events. [2024-10-24 15:32:02,524 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-10-24 15:32:02,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 3267 events. 250/3267 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28606 event pairs, 52 based on Foata normal form. 1/2784 useless extension candidates. Maximal degree in co-relation 3426. Up to 202 conditions per place. [2024-10-24 15:32:02,565 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2024-10-24 15:32:02,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 581 transitions, 1231 flow [2024-10-24 15:32:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-10-24 15:32:02,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-10-24 15:32:02,570 INFO L175 Difference]: Start difference. First operand has 572 places, 581 transitions, 1191 flow. Second operand 3 states and 1886 transitions. [2024-10-24 15:32:02,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 581 transitions, 1231 flow [2024-10-24 15:32:02,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:02,581 INFO L231 Difference]: Finished difference. Result has 571 places, 579 transitions, 1197 flow [2024-10-24 15:32:02,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=571, PETRI_TRANSITIONS=579} [2024-10-24 15:32:02,582 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-10-24 15:32:02,583 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 579 transitions, 1197 flow [2024-10-24 15:32:02,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-10-24 15:32:02,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:02,584 INFO L204 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] [2024-10-24 15:32:02,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 15:32:02,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:02,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 911023066, now seen corresponding path program 1 times [2024-10-24 15:32:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625231009] [2024-10-24 15:32:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:02,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625231009] [2024-10-24 15:32:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625231009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583421436] [2024-10-24 15:32:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:02,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-24 15:32:02,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 579 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-24 15:32:02,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:02,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-24 15:32:02,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:03,120 INFO L124 PetriNetUnfolderBase]: 108/2057 cut-off events. [2024-10-24 15:32:03,121 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-10-24 15:32:03,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 2057 events. 108/2057 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13449 event pairs, 8 based on Foata normal form. 1/1770 useless extension candidates. Maximal degree in co-relation 2089. Up to 33 conditions per place. [2024-10-24 15:32:03,158 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-10-24 15:32:03,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 580 transitions, 1231 flow [2024-10-24 15:32:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-10-24 15:32:03,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-10-24 15:32:03,163 INFO L175 Difference]: Start difference. First operand has 571 places, 579 transitions, 1197 flow. Second operand 3 states and 1894 transitions. [2024-10-24 15:32:03,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 580 transitions, 1231 flow [2024-10-24 15:32:03,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 580 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:03,175 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1199 flow [2024-10-24 15:32:03,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2024-10-24 15:32:03,176 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-10-24 15:32:03,176 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1199 flow [2024-10-24 15:32:03,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-24 15:32:03,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:03,181 INFO L204 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] [2024-10-24 15:32:03,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 15:32:03,182 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 44543776, now seen corresponding path program 1 times [2024-10-24 15:32:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041454150] [2024-10-24 15:32:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:03,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041454150] [2024-10-24 15:32:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041454150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:03,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:32:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957718727] [2024-10-24 15:32:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:03,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:03,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-24 15:32:03,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-10-24 15:32:03,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:03,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-24 15:32:03,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:03,602 INFO L124 PetriNetUnfolderBase]: 89/1589 cut-off events. [2024-10-24 15:32:03,602 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-24 15:32:03,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1589 events. 89/1589 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10195 event pairs, 12 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2024-10-24 15:32:03,638 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2024-10-24 15:32:03,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 581 transitions, 1241 flow [2024-10-24 15:32:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-24 15:32:03,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-24 15:32:03,644 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1199 flow. Second operand 3 states and 1896 transitions. [2024-10-24 15:32:03,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 581 transitions, 1241 flow [2024-10-24 15:32:03,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 581 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:03,658 INFO L231 Difference]: Finished difference. Result has 574 places, 579 transitions, 1213 flow [2024-10-24 15:32:03,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2024-10-24 15:32:03,660 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -37 predicate places. [2024-10-24 15:32:03,660 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1213 flow [2024-10-24 15:32:03,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-10-24 15:32:03,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:03,661 INFO L204 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] [2024-10-24 15:32:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 15:32:03,661 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:03,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 578733025, now seen corresponding path program 1 times [2024-10-24 15:32:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262802154] [2024-10-24 15:32:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262802154] [2024-10-24 15:32:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262802154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:03,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931081008] [2024-10-24 15:32:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:03,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:03,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-24 15:32:03,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-24 15:32:03,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:03,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-24 15:32:03,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:04,257 INFO L124 PetriNetUnfolderBase]: 197/2613 cut-off events. [2024-10-24 15:32:04,258 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-10-24 15:32:04,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 2613 events. 197/2613 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19808 event pairs, 24 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2827. Up to 168 conditions per place. [2024-10-24 15:32:04,304 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2024-10-24 15:32:04,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 582 transitions, 1268 flow [2024-10-24 15:32:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-24 15:32:04,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-24 15:32:04,308 INFO L175 Difference]: Start difference. First operand has 574 places, 579 transitions, 1213 flow. Second operand 3 states and 1889 transitions. [2024-10-24 15:32:04,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 582 transitions, 1268 flow [2024-10-24 15:32:04,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 582 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:04,320 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1213 flow [2024-10-24 15:32:04,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2024-10-24 15:32:04,321 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-10-24 15:32:04,321 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1213 flow [2024-10-24 15:32:04,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-24 15:32:04,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:04,322 INFO L204 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] [2024-10-24 15:32:04,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 15:32:04,323 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1172048154, now seen corresponding path program 1 times [2024-10-24 15:32:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:04,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920566615] [2024-10-24 15:32:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:04,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920566615] [2024-10-24 15:32:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920566615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:04,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:04,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735639788] [2024-10-24 15:32:04,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:04,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:04,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-24 15:32:04,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:04,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:04,881 INFO L124 PetriNetUnfolderBase]: 169/2812 cut-off events. [2024-10-24 15:32:04,882 INFO L125 PetriNetUnfolderBase]: For 20/59 co-relation queries the response was YES. [2024-10-24 15:32:04,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2812 events. 169/2812 cut-off events. For 20/59 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 20819 event pairs, 19 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 2941. Up to 72 conditions per place. [2024-10-24 15:32:04,943 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-10-24 15:32:04,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 578 transitions, 1249 flow [2024-10-24 15:32:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-24 15:32:04,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-24 15:32:04,948 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1213 flow. Second operand 3 states and 1892 transitions. [2024-10-24 15:32:04,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 578 transitions, 1249 flow [2024-10-24 15:32:04,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1249 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:04,959 INFO L231 Difference]: Finished difference. Result has 572 places, 576 transitions, 1215 flow [2024-10-24 15:32:04,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=572, PETRI_TRANSITIONS=576} [2024-10-24 15:32:04,960 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-10-24 15:32:04,960 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 576 transitions, 1215 flow [2024-10-24 15:32:04,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-24 15:32:04,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:04,961 INFO L204 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] [2024-10-24 15:32:04,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 15:32:04,962 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:04,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -756035181, now seen corresponding path program 1 times [2024-10-24 15:32:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:04,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264372739] [2024-10-24 15:32:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:05,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264372739] [2024-10-24 15:32:05,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264372739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:05,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160790758] [2024-10-24 15:32:05,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:05,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:05,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:05,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-24 15:32:05,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 576 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-24 15:32:05,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:05,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-24 15:32:05,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:05,477 INFO L124 PetriNetUnfolderBase]: 147/2543 cut-off events. [2024-10-24 15:32:05,477 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-10-24 15:32:05,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2543 events. 147/2543 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18068 event pairs, 10 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 2661. Up to 44 conditions per place. [2024-10-24 15:32:05,515 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-10-24 15:32:05,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1249 flow [2024-10-24 15:32:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-10-24 15:32:05,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-10-24 15:32:05,519 INFO L175 Difference]: Start difference. First operand has 572 places, 576 transitions, 1215 flow. Second operand 3 states and 1894 transitions. [2024-10-24 15:32:05,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1249 flow [2024-10-24 15:32:05,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:05,530 INFO L231 Difference]: Finished difference. Result has 571 places, 575 transitions, 1213 flow [2024-10-24 15:32:05,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=575} [2024-10-24 15:32:05,531 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-10-24 15:32:05,531 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 575 transitions, 1213 flow [2024-10-24 15:32:05,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-24 15:32:05,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:05,532 INFO L204 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] [2024-10-24 15:32:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 15:32:05,532 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash 833850535, now seen corresponding path program 1 times [2024-10-24 15:32:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:05,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581422718] [2024-10-24 15:32:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581422718] [2024-10-24 15:32:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581422718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:05,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808450473] [2024-10-24 15:32:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:06,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-24 15:32:06,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 575 transitions, 1213 flow. Second operand has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-10-24 15:32:06,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:06,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-24 15:32:06,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:07,246 INFO L124 PetriNetUnfolderBase]: 235/3653 cut-off events. [2024-10-24 15:32:07,246 INFO L125 PetriNetUnfolderBase]: For 9/27 co-relation queries the response was YES. [2024-10-24 15:32:07,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3653 events. 235/3653 cut-off events. For 9/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31299 event pairs, 43 based on Foata normal form. 5/3193 useless extension candidates. Maximal degree in co-relation 4072. Up to 155 conditions per place. [2024-10-24 15:32:07,330 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/614 dead transitions. [2024-10-24 15:32:07,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 614 transitions, 1479 flow [2024-10-24 15:32:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-10-24 15:32:07,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-10-24 15:32:07,343 INFO L175 Difference]: Start difference. First operand has 571 places, 575 transitions, 1213 flow. Second operand 11 states and 6620 transitions. [2024-10-24 15:32:07,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 614 transitions, 1479 flow [2024-10-24 15:32:07,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 614 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:07,357 INFO L231 Difference]: Finished difference. Result has 584 places, 584 transitions, 1293 flow [2024-10-24 15:32:07,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=584} [2024-10-24 15:32:07,358 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-10-24 15:32:07,358 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 584 transitions, 1293 flow [2024-10-24 15:32:07,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-10-24 15:32:07,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:07,359 INFO L204 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] [2024-10-24 15:32:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 15:32:07,360 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:07,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash -206713279, now seen corresponding path program 1 times [2024-10-24 15:32:07,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:07,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134241626] [2024-10-24 15:32:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:07,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-10-24 15:32:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134241626] [2024-10-24 15:32:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134241626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:07,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833072570] [2024-10-24 15:32:07,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:07,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:07,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-24 15:32:07,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:07,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:07,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:07,985 INFO L124 PetriNetUnfolderBase]: 191/2428 cut-off events. [2024-10-24 15:32:07,986 INFO L125 PetriNetUnfolderBase]: For 79/144 co-relation queries the response was YES. [2024-10-24 15:32:08,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2428 events. 191/2428 cut-off events. For 79/144 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 18743 event pairs, 44 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2724. Up to 165 conditions per place. [2024-10-24 15:32:08,029 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-24 15:32:08,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 585 transitions, 1329 flow [2024-10-24 15:32:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-24 15:32:08,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-24 15:32:08,033 INFO L175 Difference]: Start difference. First operand has 584 places, 584 transitions, 1293 flow. Second operand 3 states and 1892 transitions. [2024-10-24 15:32:08,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 585 transitions, 1329 flow [2024-10-24 15:32:08,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 585 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:08,044 INFO L231 Difference]: Finished difference. Result has 584 places, 583 transitions, 1291 flow [2024-10-24 15:32:08,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=584, PETRI_TRANSITIONS=583} [2024-10-24 15:32:08,045 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-10-24 15:32:08,045 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 583 transitions, 1291 flow [2024-10-24 15:32:08,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-24 15:32:08,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:08,047 INFO L204 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] [2024-10-24 15:32:08,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 15:32:08,047 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash -245544325, now seen corresponding path program 1 times [2024-10-24 15:32:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25922381] [2024-10-24 15:32:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:08,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25922381] [2024-10-24 15:32:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25922381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:08,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:32:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284456688] [2024-10-24 15:32:08,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:08,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:08,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:08,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-24 15:32:08,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 583 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-10-24 15:32:08,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:08,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-24 15:32:08,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:08,803 INFO L124 PetriNetUnfolderBase]: 254/3174 cut-off events. [2024-10-24 15:32:08,803 INFO L125 PetriNetUnfolderBase]: For 114/211 co-relation queries the response was YES. [2024-10-24 15:32:08,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3174 events. 254/3174 cut-off events. For 114/211 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 24936 event pairs, 66 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 3606. Up to 236 conditions per place. [2024-10-24 15:32:08,857 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-10-24 15:32:08,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 586 transitions, 1333 flow [2024-10-24 15:32:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-24 15:32:08,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-24 15:32:08,861 INFO L175 Difference]: Start difference. First operand has 584 places, 583 transitions, 1291 flow. Second operand 3 states and 1896 transitions. [2024-10-24 15:32:08,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 586 transitions, 1333 flow [2024-10-24 15:32:08,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 586 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:08,869 INFO L231 Difference]: Finished difference. Result has 586 places, 584 transitions, 1305 flow [2024-10-24 15:32:08,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=586, PETRI_TRANSITIONS=584} [2024-10-24 15:32:08,870 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-10-24 15:32:08,870 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 584 transitions, 1305 flow [2024-10-24 15:32:08,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-10-24 15:32:08,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:08,871 INFO L204 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] [2024-10-24 15:32:08,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 15:32:08,871 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 894546295, now seen corresponding path program 1 times [2024-10-24 15:32:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600421863] [2024-10-24 15:32:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600421863] [2024-10-24 15:32:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600421863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:32:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483155394] [2024-10-24 15:32:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:08,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-24 15:32:08,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 584 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-10-24 15:32:08,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:08,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-24 15:32:08,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:09,697 INFO L124 PetriNetUnfolderBase]: 299/3771 cut-off events. [2024-10-24 15:32:09,697 INFO L125 PetriNetUnfolderBase]: For 92/125 co-relation queries the response was YES. [2024-10-24 15:32:09,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 3771 events. 299/3771 cut-off events. For 92/125 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33338 event pairs, 72 based on Foata normal form. 0/3318 useless extension candidates. Maximal degree in co-relation 4389. Up to 227 conditions per place. [2024-10-24 15:32:09,765 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2024-10-24 15:32:09,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 587 transitions, 1347 flow [2024-10-24 15:32:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-24 15:32:09,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-24 15:32:09,768 INFO L175 Difference]: Start difference. First operand has 586 places, 584 transitions, 1305 flow. Second operand 3 states and 1896 transitions. [2024-10-24 15:32:09,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 587 transitions, 1347 flow [2024-10-24 15:32:09,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 587 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:09,778 INFO L231 Difference]: Finished difference. Result has 588 places, 585 transitions, 1317 flow [2024-10-24 15:32:09,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=588, PETRI_TRANSITIONS=585} [2024-10-24 15:32:09,779 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -23 predicate places. [2024-10-24 15:32:09,780 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 585 transitions, 1317 flow [2024-10-24 15:32:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-10-24 15:32:09,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:09,781 INFO L204 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] [2024-10-24 15:32:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 15:32:09,781 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash -525151164, now seen corresponding path program 1 times [2024-10-24 15:32:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:09,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176771440] [2024-10-24 15:32:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:09,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176771440] [2024-10-24 15:32:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176771440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225675558] [2024-10-24 15:32:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:09,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:09,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:09,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 585 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-24 15:32:09,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:09,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:09,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:10,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][466], [673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 687#(= |#race~count3~0| 0), 699#(= |#race~get1~0| 0), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 740#true, Black: 681#true, 745#true, 683#(= |#race~count2~0| 0), Black: 685#true, 679#(= |#race~count1~0| 0), 667#(= |#race~n2~0| 0), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 401#$Ultimate##0true]) [2024-10-24 15:32:10,549 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-10-24 15:32:10,550 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-24 15:32:10,550 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-10-24 15:32:10,550 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-10-24 15:32:10,656 INFO L124 PetriNetUnfolderBase]: 307/4941 cut-off events. [2024-10-24 15:32:10,656 INFO L125 PetriNetUnfolderBase]: For 60/125 co-relation queries the response was YES. [2024-10-24 15:32:10,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 4941 events. 307/4941 cut-off events. For 60/125 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 43982 event pairs, 29 based on Foata normal form. 0/4343 useless extension candidates. Maximal degree in co-relation 5540. Up to 131 conditions per place. [2024-10-24 15:32:10,741 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-10-24 15:32:10,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 586 transitions, 1353 flow [2024-10-24 15:32:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-24 15:32:10,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-24 15:32:10,745 INFO L175 Difference]: Start difference. First operand has 588 places, 585 transitions, 1317 flow. Second operand 3 states and 1892 transitions. [2024-10-24 15:32:10,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 586 transitions, 1353 flow [2024-10-24 15:32:10,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 586 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:10,761 INFO L231 Difference]: Finished difference. Result has 587 places, 584 transitions, 1313 flow [2024-10-24 15:32:10,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=587, PETRI_TRANSITIONS=584} [2024-10-24 15:32:10,762 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -24 predicate places. [2024-10-24 15:32:10,762 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 584 transitions, 1313 flow [2024-10-24 15:32:10,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-24 15:32:10,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:10,763 INFO L204 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] [2024-10-24 15:32:10,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 15:32:10,763 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash 38540104, now seen corresponding path program 1 times [2024-10-24 15:32:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:10,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970482588] [2024-10-24 15:32:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970482588] [2024-10-24 15:32:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970482588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:10,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:10,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12592209] [2024-10-24 15:32:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:10,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:10,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:10,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:10,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-24 15:32:10,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 584 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-10-24 15:32:10,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:10,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-24 15:32:10,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:11,818 INFO L124 PetriNetUnfolderBase]: 369/4945 cut-off events. [2024-10-24 15:32:11,818 INFO L125 PetriNetUnfolderBase]: For 60/84 co-relation queries the response was YES. [2024-10-24 15:32:11,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 4945 events. 369/4945 cut-off events. For 60/84 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 43310 event pairs, 45 based on Foata normal form. 0/4405 useless extension candidates. Maximal degree in co-relation 5754. Up to 325 conditions per place. [2024-10-24 15:32:11,910 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-10-24 15:32:11,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 587 transitions, 1368 flow [2024-10-24 15:32:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-24 15:32:11,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-24 15:32:11,913 INFO L175 Difference]: Start difference. First operand has 587 places, 584 transitions, 1313 flow. Second operand 3 states and 1889 transitions. [2024-10-24 15:32:11,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 587 transitions, 1368 flow [2024-10-24 15:32:11,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 587 transitions, 1364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:11,925 INFO L231 Difference]: Finished difference. Result has 584 places, 582 transitions, 1315 flow [2024-10-24 15:32:11,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1315, PETRI_PLACES=584, PETRI_TRANSITIONS=582} [2024-10-24 15:32:11,926 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-10-24 15:32:11,926 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 582 transitions, 1315 flow [2024-10-24 15:32:11,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-10-24 15:32:11,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:11,928 INFO L204 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] [2024-10-24 15:32:11,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 15:32:11,928 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:11,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash -598679417, now seen corresponding path program 1 times [2024-10-24 15:32:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777025499] [2024-10-24 15:32:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777025499] [2024-10-24 15:32:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777025499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544259638] [2024-10-24 15:32:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:12,736 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-24 15:32:12,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 582 transitions, 1315 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-24 15:32:12,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:12,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-24 15:32:12,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:13,834 INFO L124 PetriNetUnfolderBase]: 394/4918 cut-off events. [2024-10-24 15:32:13,835 INFO L125 PetriNetUnfolderBase]: For 95/173 co-relation queries the response was YES. [2024-10-24 15:32:13,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 4918 events. 394/4918 cut-off events. For 95/173 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 44741 event pairs, 108 based on Foata normal form. 8/4389 useless extension candidates. Maximal degree in co-relation 5912. Up to 341 conditions per place. [2024-10-24 15:32:13,931 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/616 dead transitions. [2024-10-24 15:32:13,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 616 transitions, 1571 flow [2024-10-24 15:32:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-10-24 15:32:13,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-10-24 15:32:13,941 INFO L175 Difference]: Start difference. First operand has 584 places, 582 transitions, 1315 flow. Second operand 11 states and 6620 transitions. [2024-10-24 15:32:13,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 616 transitions, 1571 flow [2024-10-24 15:32:13,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:13,951 INFO L231 Difference]: Finished difference. Result has 597 places, 586 transitions, 1378 flow [2024-10-24 15:32:13,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1378, PETRI_PLACES=597, PETRI_TRANSITIONS=586} [2024-10-24 15:32:13,952 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-10-24 15:32:13,952 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 586 transitions, 1378 flow [2024-10-24 15:32:13,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-24 15:32:13,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:13,954 INFO L204 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] [2024-10-24 15:32:13,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 15:32:13,954 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:13,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1455026926, now seen corresponding path program 1 times [2024-10-24 15:32:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:13,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955293022] [2024-10-24 15:32:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955293022] [2024-10-24 15:32:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955293022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:14,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848473520] [2024-10-24 15:32:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:14,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:14,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:14,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 586 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-24 15:32:14,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:14,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:14,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 775#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-10-24 15:32:14,462 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-10-24 15:32:14,462 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-10-24 15:32:14,462 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-10-24 15:32:14,462 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-10-24 15:32:14,472 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 667#(= |#race~n2~0| 0), 775#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-10-24 15:32:14,472 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-10-24 15:32:14,472 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-24 15:32:14,472 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-10-24 15:32:14,473 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-10-24 15:32:14,473 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-24 15:32:14,488 INFO L124 PetriNetUnfolderBase]: 245/2948 cut-off events. [2024-10-24 15:32:14,489 INFO L125 PetriNetUnfolderBase]: For 111/149 co-relation queries the response was YES. [2024-10-24 15:32:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 2948 events. 245/2948 cut-off events. For 111/149 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22558 event pairs, 42 based on Foata normal form. 2/2643 useless extension candidates. Maximal degree in co-relation 3580. Up to 210 conditions per place. [2024-10-24 15:32:14,533 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-10-24 15:32:14,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 587 transitions, 1414 flow [2024-10-24 15:32:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-24 15:32:14,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-24 15:32:14,535 INFO L175 Difference]: Start difference. First operand has 597 places, 586 transitions, 1378 flow. Second operand 3 states and 1892 transitions. [2024-10-24 15:32:14,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 587 transitions, 1414 flow [2024-10-24 15:32:14,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 587 transitions, 1393 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 15:32:14,542 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1359 flow [2024-10-24 15:32:14,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=591, PETRI_TRANSITIONS=585} [2024-10-24 15:32:14,543 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -20 predicate places. [2024-10-24 15:32:14,543 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1359 flow [2024-10-24 15:32:14,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-24 15:32:14,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:14,544 INFO L204 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] [2024-10-24 15:32:14,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 15:32:14,545 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 657299342, now seen corresponding path program 1 times [2024-10-24 15:32:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239930122] [2024-10-24 15:32:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:14,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:14,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239930122] [2024-10-24 15:32:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239930122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:14,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:14,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:14,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895061494] [2024-10-24 15:32:14,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:14,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:14,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:14,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:14,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:15,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-24 15:32:15,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 585 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-10-24 15:32:15,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:15,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-24 15:32:15,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:16,144 INFO L124 PetriNetUnfolderBase]: 517/5084 cut-off events. [2024-10-24 15:32:16,144 INFO L125 PetriNetUnfolderBase]: For 327/495 co-relation queries the response was YES. [2024-10-24 15:32:16,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 5084 events. 517/5084 cut-off events. For 327/495 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 46594 event pairs, 175 based on Foata normal form. 22/4592 useless extension candidates. Maximal degree in co-relation 6722. Up to 680 conditions per place. [2024-10-24 15:32:16,230 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 66 selfloop transitions, 16 changer transitions 0/615 dead transitions. [2024-10-24 15:32:16,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 615 transitions, 1599 flow [2024-10-24 15:32:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6611 transitions. [2024-10-24 15:32:16,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917557251908397 [2024-10-24 15:32:16,234 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1359 flow. Second operand 11 states and 6611 transitions. [2024-10-24 15:32:16,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 615 transitions, 1599 flow [2024-10-24 15:32:16,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 615 transitions, 1595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:32:16,243 INFO L231 Difference]: Finished difference. Result has 604 places, 594 transitions, 1439 flow [2024-10-24 15:32:16,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1439, PETRI_PLACES=604, PETRI_TRANSITIONS=594} [2024-10-24 15:32:16,244 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -7 predicate places. [2024-10-24 15:32:16,244 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 594 transitions, 1439 flow [2024-10-24 15:32:16,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-10-24 15:32:16,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:16,245 INFO L204 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] [2024-10-24 15:32:16,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 15:32:16,245 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -672350260, now seen corresponding path program 1 times [2024-10-24 15:32:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:16,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007747237] [2024-10-24 15:32:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:32:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007747237] [2024-10-24 15:32:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007747237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194341503] [2024-10-24 15:32:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:16,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:16,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:16,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-24 15:32:16,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 594 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-24 15:32:16,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:16,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-24 15:32:16,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:17,830 INFO L124 PetriNetUnfolderBase]: 412/5900 cut-off events. [2024-10-24 15:32:17,830 INFO L125 PetriNetUnfolderBase]: For 179/209 co-relation queries the response was YES. [2024-10-24 15:32:17,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 5900 events. 412/5900 cut-off events. For 179/209 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 55316 event pairs, 52 based on Foata normal form. 2/5387 useless extension candidates. Maximal degree in co-relation 7561. Up to 214 conditions per place. [2024-10-24 15:32:17,961 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 71 selfloop transitions, 24 changer transitions 0/628 dead transitions. [2024-10-24 15:32:17,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 628 transitions, 1745 flow [2024-10-24 15:32:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 15:32:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 15:32:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7210 transitions. [2024-10-24 15:32:17,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173027989821882 [2024-10-24 15:32:17,965 INFO L175 Difference]: Start difference. First operand has 604 places, 594 transitions, 1439 flow. Second operand 12 states and 7210 transitions. [2024-10-24 15:32:17,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 628 transitions, 1745 flow [2024-10-24 15:32:17,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 628 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:17,975 INFO L231 Difference]: Finished difference. Result has 618 places, 603 transitions, 1568 flow [2024-10-24 15:32:17,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1568, PETRI_PLACES=618, PETRI_TRANSITIONS=603} [2024-10-24 15:32:17,975 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 7 predicate places. [2024-10-24 15:32:17,976 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 603 transitions, 1568 flow [2024-10-24 15:32:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-24 15:32:17,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:17,977 INFO L204 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] [2024-10-24 15:32:17,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 15:32:17,977 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:17,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1226939412, now seen corresponding path program 1 times [2024-10-24 15:32:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654655140] [2024-10-24 15:32:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:32:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654655140] [2024-10-24 15:32:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654655140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822927463] [2024-10-24 15:32:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:18,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:18,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-24 15:32:18,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 603 transitions, 1568 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-10-24 15:32:18,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:18,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-24 15:32:18,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:20,176 INFO L124 PetriNetUnfolderBase]: 933/11346 cut-off events. [2024-10-24 15:32:20,176 INFO L125 PetriNetUnfolderBase]: For 719/862 co-relation queries the response was YES. [2024-10-24 15:32:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15212 conditions, 11346 events. 933/11346 cut-off events. For 719/862 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 128035 event pairs, 171 based on Foata normal form. 8/10333 useless extension candidates. Maximal degree in co-relation 15100. Up to 512 conditions per place. [2024-10-24 15:32:20,382 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 67 selfloop transitions, 24 changer transitions 0/633 dead transitions. [2024-10-24 15:32:20,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 633 transitions, 1858 flow [2024-10-24 15:32:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 15:32:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 15:32:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7201 transitions. [2024-10-24 15:32:20,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9161577608142494 [2024-10-24 15:32:20,386 INFO L175 Difference]: Start difference. First operand has 618 places, 603 transitions, 1568 flow. Second operand 12 states and 7201 transitions. [2024-10-24 15:32:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 633 transitions, 1858 flow [2024-10-24 15:32:20,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 633 transitions, 1841 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 15:32:20,408 INFO L231 Difference]: Finished difference. Result has 629 places, 617 transitions, 1705 flow [2024-10-24 15:32:20,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1705, PETRI_PLACES=629, PETRI_TRANSITIONS=617} [2024-10-24 15:32:20,410 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 18 predicate places. [2024-10-24 15:32:20,410 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 617 transitions, 1705 flow [2024-10-24 15:32:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-10-24 15:32:20,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:20,411 INFO L204 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] [2024-10-24 15:32:20,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 15:32:20,411 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:20,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1359405079, now seen corresponding path program 1 times [2024-10-24 15:32:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467374284] [2024-10-24 15:32:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:32:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467374284] [2024-10-24 15:32:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467374284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 15:32:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619285541] [2024-10-24 15:32:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:32:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:32:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:32:21,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-24 15:32:21,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 617 transitions, 1705 flow. Second operand has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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-10-24 15:32:21,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:21,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-24 15:32:21,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:22,365 INFO L124 PetriNetUnfolderBase]: 714/6923 cut-off events. [2024-10-24 15:32:22,365 INFO L125 PetriNetUnfolderBase]: For 1164/1353 co-relation queries the response was YES. [2024-10-24 15:32:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 6923 events. 714/6923 cut-off events. For 1164/1353 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 68420 event pairs, 221 based on Foata normal form. 0/6328 useless extension candidates. Maximal degree in co-relation 10077. Up to 849 conditions per place. [2024-10-24 15:32:22,498 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 69 selfloop transitions, 20 changer transitions 0/640 dead transitions. [2024-10-24 15:32:22,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 640 transitions, 1975 flow [2024-10-24 15:32:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:32:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:32:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6604 transitions. [2024-10-24 15:32:22,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.916585704371964 [2024-10-24 15:32:22,504 INFO L175 Difference]: Start difference. First operand has 629 places, 617 transitions, 1705 flow. Second operand 11 states and 6604 transitions. [2024-10-24 15:32:22,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 640 transitions, 1975 flow [2024-10-24 15:32:22,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 640 transitions, 1975 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:22,523 INFO L231 Difference]: Finished difference. Result has 642 places, 625 transitions, 1822 flow [2024-10-24 15:32:22,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1822, PETRI_PLACES=642, PETRI_TRANSITIONS=625} [2024-10-24 15:32:22,524 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2024-10-24 15:32:22,524 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 625 transitions, 1822 flow [2024-10-24 15:32:22,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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-10-24 15:32:22,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:22,525 INFO L204 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] [2024-10-24 15:32:22,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 15:32:22,526 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:22,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1191969725, now seen corresponding path program 1 times [2024-10-24 15:32:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209062519] [2024-10-24 15:32:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209062519] [2024-10-24 15:32:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209062519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337307020] [2024-10-24 15:32:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:23,499 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-10-24 15:32:23,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 625 transitions, 1822 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-10-24 15:32:23,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:23,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-10-24 15:32:23,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:24,960 INFO L124 PetriNetUnfolderBase]: 655/9738 cut-off events. [2024-10-24 15:32:24,961 INFO L125 PetriNetUnfolderBase]: For 1894/1962 co-relation queries the response was YES. [2024-10-24 15:32:25,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13819 conditions, 9738 events. 655/9738 cut-off events. For 1894/1962 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 102000 event pairs, 42 based on Foata normal form. 10/9045 useless extension candidates. Maximal degree in co-relation 13691. Up to 282 conditions per place. [2024-10-24 15:32:25,142 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/632 dead transitions. [2024-10-24 15:32:25,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 632 transitions, 1944 flow [2024-10-24 15:32:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-10-24 15:32:25,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-10-24 15:32:25,145 INFO L175 Difference]: Start difference. First operand has 642 places, 625 transitions, 1822 flow. Second operand 6 states and 3674 transitions. [2024-10-24 15:32:25,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 632 transitions, 1944 flow [2024-10-24 15:32:25,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 632 transitions, 1923 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 15:32:25,175 INFO L231 Difference]: Finished difference. Result has 639 places, 624 transitions, 1820 flow [2024-10-24 15:32:25,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1820, PETRI_PLACES=639, PETRI_TRANSITIONS=624} [2024-10-24 15:32:25,177 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-10-24 15:32:25,177 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 624 transitions, 1820 flow [2024-10-24 15:32:25,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-10-24 15:32:25,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:25,177 INFO L204 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] [2024-10-24 15:32:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 15:32:25,178 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:25,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1944970583, now seen corresponding path program 1 times [2024-10-24 15:32:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472470148] [2024-10-24 15:32:25,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472470148] [2024-10-24 15:32:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472470148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672370758] [2024-10-24 15:32:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:25,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:25,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:25,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:26,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-10-24 15:32:26,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 624 transitions, 1820 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-10-24 15:32:26,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:26,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-10-24 15:32:26,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:27,965 INFO L124 PetriNetUnfolderBase]: 744/10591 cut-off events. [2024-10-24 15:32:27,965 INFO L125 PetriNetUnfolderBase]: For 2110/2252 co-relation queries the response was YES. [2024-10-24 15:32:28,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15045 conditions, 10591 events. 744/10591 cut-off events. For 2110/2252 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 113091 event pairs, 70 based on Foata normal form. 15/9809 useless extension candidates. Maximal degree in co-relation 14917. Up to 378 conditions per place. [2024-10-24 15:32:28,168 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/631 dead transitions. [2024-10-24 15:32:28,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 631 transitions, 1942 flow [2024-10-24 15:32:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-10-24 15:32:28,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-10-24 15:32:28,170 INFO L175 Difference]: Start difference. First operand has 639 places, 624 transitions, 1820 flow. Second operand 6 states and 3674 transitions. [2024-10-24 15:32:28,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 631 transitions, 1942 flow [2024-10-24 15:32:28,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 631 transitions, 1929 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 15:32:28,205 INFO L231 Difference]: Finished difference. Result has 639 places, 623 transitions, 1826 flow [2024-10-24 15:32:28,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1803, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1826, PETRI_PLACES=639, PETRI_TRANSITIONS=623} [2024-10-24 15:32:28,207 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-10-24 15:32:28,207 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 623 transitions, 1826 flow [2024-10-24 15:32:28,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-10-24 15:32:28,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:28,208 INFO L204 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] [2024-10-24 15:32:28,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 15:32:28,208 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -384633757, now seen corresponding path program 1 times [2024-10-24 15:32:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152105388] [2024-10-24 15:32:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152105388] [2024-10-24 15:32:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152105388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009424311] [2024-10-24 15:32:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:28,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:29,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-10-24 15:32:29,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 623 transitions, 1826 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-10-24 15:32:29,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:29,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-10-24 15:32:29,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:30,776 INFO L124 PetriNetUnfolderBase]: 633/9637 cut-off events. [2024-10-24 15:32:30,777 INFO L125 PetriNetUnfolderBase]: For 1965/2033 co-relation queries the response was YES. [2024-10-24 15:32:30,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13753 conditions, 9637 events. 633/9637 cut-off events. For 1965/2033 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 100537 event pairs, 42 based on Foata normal form. 10/8985 useless extension candidates. Maximal degree in co-relation 13624. Up to 282 conditions per place. [2024-10-24 15:32:30,957 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/629 dead transitions. [2024-10-24 15:32:30,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 629 transitions, 1942 flow [2024-10-24 15:32:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-10-24 15:32:30,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-10-24 15:32:30,960 INFO L175 Difference]: Start difference. First operand has 639 places, 623 transitions, 1826 flow. Second operand 6 states and 3674 transitions. [2024-10-24 15:32:30,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 629 transitions, 1942 flow [2024-10-24 15:32:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 629 transitions, 1929 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 15:32:30,991 INFO L231 Difference]: Finished difference. Result has 638 places, 621 transitions, 1821 flow [2024-10-24 15:32:30,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1821, PETRI_PLACES=638, PETRI_TRANSITIONS=621} [2024-10-24 15:32:30,992 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 27 predicate places. [2024-10-24 15:32:30,993 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 621 transitions, 1821 flow [2024-10-24 15:32:30,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-10-24 15:32:30,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:30,993 INFO L204 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] [2024-10-24 15:32:30,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 15:32:30,994 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:30,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:30,994 INFO L85 PathProgramCache]: Analyzing trace with hash 806009401, now seen corresponding path program 1 times [2024-10-24 15:32:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833975766] [2024-10-24 15:32:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:31,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833975766] [2024-10-24 15:32:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833975766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:31,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868404632] [2024-10-24 15:32:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:31,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:31,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:31,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-24 15:32:31,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 621 transitions, 1821 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-10-24 15:32:31,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:31,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-24 15:32:31,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:32,703 INFO L124 PetriNetUnfolderBase]: 742/9682 cut-off events. [2024-10-24 15:32:32,703 INFO L125 PetriNetUnfolderBase]: For 1230/1250 co-relation queries the response was YES. [2024-10-24 15:32:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13080 conditions, 9682 events. 742/9682 cut-off events. For 1230/1250 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 97757 event pairs, 79 based on Foata normal form. 0/8959 useless extension candidates. Maximal degree in co-relation 12952. Up to 558 conditions per place. [2024-10-24 15:32:32,889 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 19 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2024-10-24 15:32:32,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 623 transitions, 1871 flow [2024-10-24 15:32:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1888 transitions. [2024-10-24 15:32:32,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608142493638677 [2024-10-24 15:32:32,891 INFO L175 Difference]: Start difference. First operand has 638 places, 621 transitions, 1821 flow. Second operand 3 states and 1888 transitions. [2024-10-24 15:32:32,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 623 transitions, 1871 flow [2024-10-24 15:32:32,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 623 transitions, 1859 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:32:32,909 INFO L231 Difference]: Finished difference. Result has 632 places, 619 transitions, 1815 flow [2024-10-24 15:32:32,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=632, PETRI_TRANSITIONS=619} [2024-10-24 15:32:32,910 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 21 predicate places. [2024-10-24 15:32:32,910 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 619 transitions, 1815 flow [2024-10-24 15:32:32,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-10-24 15:32:32,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:32,911 INFO L204 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] [2024-10-24 15:32:32,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 15:32:32,911 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:32,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -306177816, now seen corresponding path program 1 times [2024-10-24 15:32:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786634024] [2024-10-24 15:32:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786634024] [2024-10-24 15:32:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786634024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:33,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881580263] [2024-10-24 15:32:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:33,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:33,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:33,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-10-24 15:32:33,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 619 transitions, 1815 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-10-24 15:32:33,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:33,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-10-24 15:32:33,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:34,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][595], [322#L90-4true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 902#(= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:34,855 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-10-24 15:32:34,855 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-10-24 15:32:34,855 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-24 15:32:34,855 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-24 15:32:34,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][599], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 138#L90-5true, 903#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:34,857 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-10-24 15:32:34,857 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:34,857 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:34,857 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:34,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][603], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 421#L90-6true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), 904#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0)), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:34,859 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-10-24 15:32:34,859 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:34,859 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2024-10-24 15:32:34,859 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:34,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, 108#L90-7true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:34,861 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2024-10-24 15:32:34,861 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-24 15:32:34,861 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-10-24 15:32:34,861 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-24 15:32:34,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), 612#L90-8true, Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:34,863 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-10-24 15:32:34,863 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-24 15:32:34,863 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-24 15:32:34,863 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-10-24 15:32:34,871 INFO L124 PetriNetUnfolderBase]: 641/6977 cut-off events. [2024-10-24 15:32:34,871 INFO L125 PetriNetUnfolderBase]: For 1955/2194 co-relation queries the response was YES. [2024-10-24 15:32:34,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10507 conditions, 6977 events. 641/6977 cut-off events. For 1955/2194 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 67633 event pairs, 87 based on Foata normal form. 39/6607 useless extension candidates. Maximal degree in co-relation 10378. Up to 441 conditions per place. [2024-10-24 15:32:34,998 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/626 dead transitions. [2024-10-24 15:32:34,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 626 transitions, 1937 flow [2024-10-24 15:32:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-10-24 15:32:35,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-10-24 15:32:35,000 INFO L175 Difference]: Start difference. First operand has 632 places, 619 transitions, 1815 flow. Second operand 6 states and 3674 transitions. [2024-10-24 15:32:35,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 626 transitions, 1937 flow [2024-10-24 15:32:35,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 626 transitions, 1937 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:35,022 INFO L231 Difference]: Finished difference. Result has 636 places, 618 transitions, 1834 flow [2024-10-24 15:32:35,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1834, PETRI_PLACES=636, PETRI_TRANSITIONS=618} [2024-10-24 15:32:35,023 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 25 predicate places. [2024-10-24 15:32:35,023 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 618 transitions, 1834 flow [2024-10-24 15:32:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-10-24 15:32:35,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:35,024 INFO L204 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] [2024-10-24 15:32:35,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 15:32:35,024 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:35,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash -151739267, now seen corresponding path program 1 times [2024-10-24 15:32:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306336003] [2024-10-24 15:32:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:35,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306336003] [2024-10-24 15:32:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306336003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779874842] [2024-10-24 15:32:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:36,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-10-24 15:32:36,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 618 transitions, 1834 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-10-24 15:32:36,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:36,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-10-24 15:32:36,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:37,791 INFO L124 PetriNetUnfolderBase]: 785/11057 cut-off events. [2024-10-24 15:32:37,791 INFO L125 PetriNetUnfolderBase]: For 2519/2652 co-relation queries the response was YES. [2024-10-24 15:32:37,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16324 conditions, 11057 events. 785/11057 cut-off events. For 2519/2652 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 119138 event pairs, 72 based on Foata normal form. 17/10450 useless extension candidates. Maximal degree in co-relation 16193. Up to 417 conditions per place. [2024-10-24 15:32:37,945 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2024-10-24 15:32:37,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 624 transitions, 1950 flow [2024-10-24 15:32:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-10-24 15:32:37,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-10-24 15:32:37,948 INFO L175 Difference]: Start difference. First operand has 636 places, 618 transitions, 1834 flow. Second operand 6 states and 3674 transitions. [2024-10-24 15:32:37,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 624 transitions, 1950 flow [2024-10-24 15:32:37,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 624 transitions, 1937 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 15:32:37,971 INFO L231 Difference]: Finished difference. Result has 635 places, 616 transitions, 1829 flow [2024-10-24 15:32:37,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1829, PETRI_PLACES=635, PETRI_TRANSITIONS=616} [2024-10-24 15:32:37,972 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 24 predicate places. [2024-10-24 15:32:37,972 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 616 transitions, 1829 flow [2024-10-24 15:32:37,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-10-24 15:32:37,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:37,973 INFO L204 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] [2024-10-24 15:32:37,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 15:32:37,973 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:37,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1023730657, now seen corresponding path program 1 times [2024-10-24 15:32:37,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723364244] [2024-10-24 15:32:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:37,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723364244] [2024-10-24 15:32:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723364244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:38,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:38,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704083593] [2024-10-24 15:32:38,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:38,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:38,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:38,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:38,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 655 [2024-10-24 15:32:38,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 616 transitions, 1829 flow. Second operand has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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-10-24 15:32:38,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:38,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 655 [2024-10-24 15:32:38,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:39,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 913#true, Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 907#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:39,620 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:39,620 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:39,620 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:39,620 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:39,634 INFO L124 PetriNetUnfolderBase]: 643/10323 cut-off events. [2024-10-24 15:32:39,634 INFO L125 PetriNetUnfolderBase]: For 1813/1847 co-relation queries the response was YES. [2024-10-24 15:32:39,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14625 conditions, 10323 events. 643/10323 cut-off events. For 1813/1847 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 107073 event pairs, 42 based on Foata normal form. 0/9769 useless extension candidates. Maximal degree in co-relation 14495. Up to 304 conditions per place. [2024-10-24 15:32:39,825 INFO L140 encePairwiseOnDemand]: 653/655 looper letters, 10 selfloop transitions, 1 changer transitions 0/615 dead transitions. [2024-10-24 15:32:39,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 615 transitions, 1849 flow [2024-10-24 15:32:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-24 15:32:39,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-24 15:32:39,826 INFO L175 Difference]: Start difference. First operand has 635 places, 616 transitions, 1829 flow. Second operand 3 states and 1896 transitions. [2024-10-24 15:32:39,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 615 transitions, 1849 flow [2024-10-24 15:32:39,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 615 transitions, 1837 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:32:39,848 INFO L231 Difference]: Finished difference. Result has 631 places, 615 transitions, 1817 flow [2024-10-24 15:32:39,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1817, PETRI_PLACES=631, PETRI_TRANSITIONS=615} [2024-10-24 15:32:39,849 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 20 predicate places. [2024-10-24 15:32:39,849 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 615 transitions, 1817 flow [2024-10-24 15:32:39,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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-10-24 15:32:39,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:39,850 INFO L204 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] [2024-10-24 15:32:39,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 15:32:39,850 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash 384614286, now seen corresponding path program 1 times [2024-10-24 15:32:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952425324] [2024-10-24 15:32:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952425324] [2024-10-24 15:32:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952425324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:40,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:32:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311141793] [2024-10-24 15:32:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:40,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:32:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:40,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:32:40,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:32:40,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-10-24 15:32:40,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 615 transitions, 1817 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-10-24 15:32:40,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:40,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-10-24 15:32:40,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:41,898 INFO L124 PetriNetUnfolderBase]: 577/6749 cut-off events. [2024-10-24 15:32:41,898 INFO L125 PetriNetUnfolderBase]: For 2163/2368 co-relation queries the response was YES. [2024-10-24 15:32:42,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10196 conditions, 6749 events. 577/6749 cut-off events. For 2163/2368 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 64460 event pairs, 87 based on Foata normal form. 37/6463 useless extension candidates. Maximal degree in co-relation 10065. Up to 445 conditions per place. [2024-10-24 15:32:42,021 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/621 dead transitions. [2024-10-24 15:32:42,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 621 transitions, 1933 flow [2024-10-24 15:32:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:32:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:32:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-10-24 15:32:42,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-10-24 15:32:42,023 INFO L175 Difference]: Start difference. First operand has 631 places, 615 transitions, 1817 flow. Second operand 6 states and 3674 transitions. [2024-10-24 15:32:42,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 621 transitions, 1933 flow [2024-10-24 15:32:42,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 621 transitions, 1932 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:42,041 INFO L231 Difference]: Finished difference. Result has 633 places, 613 transitions, 1824 flow [2024-10-24 15:32:42,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1824, PETRI_PLACES=633, PETRI_TRANSITIONS=613} [2024-10-24 15:32:42,042 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 22 predicate places. [2024-10-24 15:32:42,042 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 613 transitions, 1824 flow [2024-10-24 15:32:42,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-10-24 15:32:42,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:42,043 INFO L204 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] [2024-10-24 15:32:42,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 15:32:42,043 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 889734991, now seen corresponding path program 1 times [2024-10-24 15:32:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465872650] [2024-10-24 15:32:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:42,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465872650] [2024-10-24 15:32:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465872650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:42,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267063987] [2024-10-24 15:32:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:42,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:42,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:42,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:42,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:42,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 613 transitions, 1824 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-10-24 15:32:42,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:42,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:42,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:43,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, 916#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-10-24 15:32:43,654 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:43,654 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:43,654 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:43,654 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:43,673 INFO L124 PetriNetUnfolderBase]: 687/10501 cut-off events. [2024-10-24 15:32:43,673 INFO L125 PetriNetUnfolderBase]: For 1849/1915 co-relation queries the response was YES. [2024-10-24 15:32:43,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15134 conditions, 10501 events. 687/10501 cut-off events. For 1849/1915 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 109186 event pairs, 72 based on Foata normal form. 0/10015 useless extension candidates. Maximal degree in co-relation 15004. Up to 388 conditions per place. [2024-10-24 15:32:43,878 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 12 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2024-10-24 15:32:43,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 611 transitions, 1846 flow [2024-10-24 15:32:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1890 transitions. [2024-10-24 15:32:43,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9618320610687023 [2024-10-24 15:32:43,879 INFO L175 Difference]: Start difference. First operand has 633 places, 613 transitions, 1824 flow. Second operand 3 states and 1890 transitions. [2024-10-24 15:32:43,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 611 transitions, 1846 flow [2024-10-24 15:32:43,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 611 transitions, 1834 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:32:43,906 INFO L231 Difference]: Finished difference. Result has 628 places, 611 transitions, 1810 flow [2024-10-24 15:32:43,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1810, PETRI_PLACES=628, PETRI_TRANSITIONS=611} [2024-10-24 15:32:43,907 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 17 predicate places. [2024-10-24 15:32:43,908 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 611 transitions, 1810 flow [2024-10-24 15:32:43,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-10-24 15:32:43,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:43,908 INFO L204 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] [2024-10-24 15:32:43,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 15:32:43,908 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1875686641, now seen corresponding path program 1 times [2024-10-24 15:32:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541214314] [2024-10-24 15:32:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:32:43,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:43,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541214314] [2024-10-24 15:32:43,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541214314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:43,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436133775] [2024-10-24 15:32:43,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:43,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:43,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:43,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:43,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:43,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:43,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 611 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-10-24 15:32:43,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:43,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:43,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:44,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1726] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][392], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), 499#L97-7true, Black: 748#true, 827#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-10-24 15:32:44,967 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2024-10-24 15:32:44,967 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:44,967 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:44,967 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:44,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, 827#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-10-24 15:32:44,974 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-10-24 15:32:44,974 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2024-10-24 15:32:44,974 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-10-24 15:32:44,975 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-10-24 15:32:44,975 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-10-24 15:32:44,975 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-10-24 15:32:44,975 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:44,975 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-10-24 15:32:44,975 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:44,975 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-10-24 15:32:44,977 INFO L124 PetriNetUnfolderBase]: 441/5955 cut-off events. [2024-10-24 15:32:44,977 INFO L125 PetriNetUnfolderBase]: For 1032/1092 co-relation queries the response was YES. [2024-10-24 15:32:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8596 conditions, 5955 events. 441/5955 cut-off events. For 1032/1092 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 55181 event pairs, 87 based on Foata normal form. 15/5680 useless extension candidates. Maximal degree in co-relation 8466. Up to 367 conditions per place. [2024-10-24 15:32:45,083 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 8 selfloop transitions, 0 changer transitions 27/609 dead transitions. [2024-10-24 15:32:45,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 609 transitions, 1830 flow [2024-10-24 15:32:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-24 15:32:45,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-24 15:32:45,085 INFO L175 Difference]: Start difference. First operand has 628 places, 611 transitions, 1810 flow. Second operand 3 states and 1889 transitions. [2024-10-24 15:32:45,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 609 transitions, 1830 flow [2024-10-24 15:32:45,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 609 transitions, 1829 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:32:45,101 INFO L231 Difference]: Finished difference. Result has 627 places, 582 transitions, 1670 flow [2024-10-24 15:32:45,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1670, PETRI_PLACES=627, PETRI_TRANSITIONS=582} [2024-10-24 15:32:45,102 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 16 predicate places. [2024-10-24 15:32:45,102 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 582 transitions, 1670 flow [2024-10-24 15:32:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-10-24 15:32:45,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:45,103 INFO L204 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] [2024-10-24 15:32:45,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 15:32:45,103 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:45,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1721043426, now seen corresponding path program 1 times [2024-10-24 15:32:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508408981] [2024-10-24 15:32:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508408981] [2024-10-24 15:32:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508408981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:45,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:45,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:45,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629637517] [2024-10-24 15:32:45,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:45,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:45,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-24 15:32:45,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 582 transitions, 1670 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-24 15:32:45,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:45,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-24 15:32:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:46,662 INFO L124 PetriNetUnfolderBase]: 590/9291 cut-off events. [2024-10-24 15:32:46,662 INFO L125 PetriNetUnfolderBase]: For 1281/1307 co-relation queries the response was YES. [2024-10-24 15:32:46,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12881 conditions, 9291 events. 590/9291 cut-off events. For 1281/1307 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 93202 event pairs, 42 based on Foata normal form. 0/8884 useless extension candidates. Maximal degree in co-relation 12840. Up to 261 conditions per place. [2024-10-24 15:32:46,793 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 11 selfloop transitions, 2 changer transitions 15/583 dead transitions. [2024-10-24 15:32:46,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 583 transitions, 1700 flow [2024-10-24 15:32:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-24 15:32:46,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-24 15:32:46,795 INFO L175 Difference]: Start difference. First operand has 627 places, 582 transitions, 1670 flow. Second operand 3 states and 1892 transitions. [2024-10-24 15:32:46,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 583 transitions, 1700 flow [2024-10-24 15:32:46,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 583 transitions, 1686 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-10-24 15:32:46,812 INFO L231 Difference]: Finished difference. Result has 607 places, 566 transitions, 1554 flow [2024-10-24 15:32:46,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=607, PETRI_TRANSITIONS=566} [2024-10-24 15:32:46,813 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -4 predicate places. [2024-10-24 15:32:46,813 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 566 transitions, 1554 flow [2024-10-24 15:32:46,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-24 15:32:46,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:46,814 INFO L204 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] [2024-10-24 15:32:46,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-24 15:32:46,814 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:46,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash -713272875, now seen corresponding path program 1 times [2024-10-24 15:32:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:46,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592741319] [2024-10-24 15:32:46,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:46,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592741319] [2024-10-24 15:32:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592741319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151817699] [2024-10-24 15:32:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:46,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:46,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:46,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 566 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-24 15:32:46,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:46,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:46,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:48,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1510] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][492], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 104#L50-9true, Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), 615#L122-4true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 136#L90-1true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 576#L70-1true, Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:48,311 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-10-24 15:32:48,311 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:48,311 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-10-24 15:32:48,311 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:48,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][420], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 136#L90-1true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:48,331 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-10-24 15:32:48,331 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-10-24 15:32:48,331 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2024-10-24 15:32:48,331 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-10-24 15:32:48,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1613] L77-6-->L77-7: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_7|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_7|} AuxVars[] AssignedVars[#race~res2~0][349], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 136#L90-1true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 249#L77-7true, Black: 697#true, 190#L123-1true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-10-24 15:32:48,332 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2024-10-24 15:32:48,333 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:48,333 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-24 15:32:48,333 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-10-24 15:32:48,333 INFO L124 PetriNetUnfolderBase]: 527/7901 cut-off events. [2024-10-24 15:32:48,333 INFO L125 PetriNetUnfolderBase]: For 913/972 co-relation queries the response was YES. [2024-10-24 15:32:48,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10853 conditions, 7901 events. 527/7901 cut-off events. For 913/972 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 76412 event pairs, 61 based on Foata normal form. 0/7573 useless extension candidates. Maximal degree in co-relation 10811. Up to 233 conditions per place. [2024-10-24 15:32:48,475 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 11 selfloop transitions, 2 changer transitions 14/567 dead transitions. [2024-10-24 15:32:48,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 567 transitions, 1584 flow [2024-10-24 15:32:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-24 15:32:48,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-24 15:32:48,476 INFO L175 Difference]: Start difference. First operand has 607 places, 566 transitions, 1554 flow. Second operand 3 states and 1889 transitions. [2024-10-24 15:32:48,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 567 transitions, 1584 flow [2024-10-24 15:32:48,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 567 transitions, 1526 flow, removed 13 selfloop flow, removed 15 redundant places. [2024-10-24 15:32:48,493 INFO L231 Difference]: Finished difference. Result has 586 places, 551 transitions, 1406 flow [2024-10-24 15:32:48,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=586, PETRI_TRANSITIONS=551} [2024-10-24 15:32:48,493 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-10-24 15:32:48,494 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 551 transitions, 1406 flow [2024-10-24 15:32:48,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-24 15:32:48,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:32:48,494 INFO L204 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] [2024-10-24 15:32:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-24 15:32:48,494 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-24 15:32:48,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:32:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash -782181195, now seen corresponding path program 1 times [2024-10-24 15:32:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:32:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306136188] [2024-10-24 15:32:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:32:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:32:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:32:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:32:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:32:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306136188] [2024-10-24 15:32:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306136188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:32:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:32:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:32:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744646255] [2024-10-24 15:32:48,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:32:48,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:32:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:32:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:32:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:32:48,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-24 15:32:48,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 551 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-24 15:32:48,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:32:48,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-24 15:32:48,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:32:49,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][386], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 683#(= |#race~count2~0| 0), 803#true, 679#(= |#race~count1~0| 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 681#true, 499#L97-7true, Black: 748#true, Black: 685#true, 934#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-10-24 15:32:49,073 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is not cut-off event [2024-10-24 15:32:49,074 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-24 15:32:49,074 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-24 15:32:49,074 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2024-10-24 15:32:49,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1726] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][392], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 683#(= |#race~count2~0| 0), 803#true, 679#(= |#race~count1~0| 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 681#true, 499#L97-7true, Black: 748#true, Black: 685#true, 934#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-10-24 15:32:49,076 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2024-10-24 15:32:49,077 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:49,077 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:49,077 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-24 15:32:49,077 INFO L124 PetriNetUnfolderBase]: 276/3453 cut-off events. [2024-10-24 15:32:49,077 INFO L125 PetriNetUnfolderBase]: For 214/268 co-relation queries the response was YES. [2024-10-24 15:32:49,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 3453 events. 276/3453 cut-off events. For 214/268 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 26710 event pairs, 54 based on Foata normal form. 2/3284 useless extension candidates. Maximal degree in co-relation 4547. Up to 190 conditions per place. [2024-10-24 15:32:49,132 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 0 selfloop transitions, 0 changer transitions 552/552 dead transitions. [2024-10-24 15:32:49,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 552 transitions, 1436 flow [2024-10-24 15:32:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:32:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:32:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-24 15:32:49,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-24 15:32:49,134 INFO L175 Difference]: Start difference. First operand has 586 places, 551 transitions, 1406 flow. Second operand 3 states and 1889 transitions. [2024-10-24 15:32:49,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 552 transitions, 1436 flow [2024-10-24 15:32:49,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 552 transitions, 1382 flow, removed 11 selfloop flow, removed 15 redundant places. [2024-10-24 15:32:49,142 INFO L231 Difference]: Finished difference. Result has 565 places, 0 transitions, 0 flow [2024-10-24 15:32:49,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=565, PETRI_TRANSITIONS=0} [2024-10-24 15:32:49,143 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -46 predicate places. [2024-10-24 15:32:49,144 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 0 transitions, 0 flow [2024-10-24 15:32:49,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-24 15:32:49,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2024-10-24 15:32:49,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2024-10-24 15:32:49,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 137 remaining) [2024-10-24 15:32:49,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (133 of 137 remaining) [2024-10-24 15:32:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2024-10-24 15:32:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2024-10-24 15:32:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2024-10-24 15:32:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2024-10-24 15:32:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2024-10-24 15:32:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2024-10-24 15:32:49,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2024-10-24 15:32:49,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2024-10-24 15:32:49,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2024-10-24 15:32:49,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2024-10-24 15:32:49,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2024-10-24 15:32:49,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2024-10-24 15:32:49,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2024-10-24 15:32:49,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2024-10-24 15:32:49,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2024-10-24 15:32:49,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2024-10-24 15:32:49,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2024-10-24 15:32:49,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2024-10-24 15:32:49,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2024-10-24 15:32:49,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2024-10-24 15:32:49,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2024-10-24 15:32:49,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2024-10-24 15:32:49,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2024-10-24 15:32:49,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2024-10-24 15:32:49,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2024-10-24 15:32:49,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2024-10-24 15:32:49,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2024-10-24 15:32:49,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2024-10-24 15:32:49,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2024-10-24 15:32:49,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2024-10-24 15:32:49,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2024-10-24 15:32:49,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2024-10-24 15:32:49,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2024-10-24 15:32:49,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2024-10-24 15:32:49,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2024-10-24 15:32:49,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (91 of 137 remaining) [2024-10-24 15:32:49,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (90 of 137 remaining) [2024-10-24 15:32:49,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2024-10-24 15:32:49,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2024-10-24 15:32:49,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 137 remaining) [2024-10-24 15:32:49,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 137 remaining) [2024-10-24 15:32:49,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2024-10-24 15:32:49,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2024-10-24 15:32:49,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2024-10-24 15:32:49,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2024-10-24 15:32:49,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2024-10-24 15:32:49,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2024-10-24 15:32:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2024-10-24 15:32:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2024-10-24 15:32:49,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2024-10-24 15:32:49,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 137 remaining) [2024-10-24 15:32:49,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 137 remaining) [2024-10-24 15:32:49,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2024-10-24 15:32:49,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2024-10-24 15:32:49,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2024-10-24 15:32:49,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2024-10-24 15:32:49,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2024-10-24 15:32:49,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2024-10-24 15:32:49,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-24 15:32:49,166 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-24 15:32:49,172 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:32:49,172 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:32:49,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:32:49 BasicIcfg [2024-10-24 15:32:49,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:32:49,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:32:49,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:32:49,178 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:32:49,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:45" (3/4) ... [2024-10-24 15:32:49,179 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 15:32:49,183 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-24 15:32:49,183 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-24 15:32:49,183 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-24 15:32:49,190 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-10-24 15:32:49,190 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 15:32:49,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 15:32:49,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 15:32:49,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 15:32:49,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 15:32:49,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:32:49,302 INFO L158 Benchmark]: Toolchain (without parser) took 65864.61ms. Allocated memory was 159.4MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 102.9MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-10-24 15:32:49,302 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 118.5MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:32:49,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.70ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 86.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 15:32:49,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.65ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:32:49,303 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 80.2MB in the end (delta: 3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:32:49,303 INFO L158 Benchmark]: RCFGBuilder took 1126.74ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 80.2MB in the beginning and 172.9MB in the end (delta: -92.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-10-24 15:32:49,304 INFO L158 Benchmark]: TraceAbstraction took 64132.28ms. Allocated memory was 237.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 172.9MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-10-24 15:32:49,304 INFO L158 Benchmark]: Witness Printer took 124.15ms. Allocated memory is still 8.9GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 15:32:49,305 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 118.5MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.70ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 86.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.65ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 80.2MB in the end (delta: 3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1126.74ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 80.2MB in the beginning and 172.9MB in the end (delta: -92.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 64132.28ms. Allocated memory was 237.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 172.9MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 124.15ms. Allocated memory is still 8.9GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 950 locations, 137 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 63.9s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 56.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7056 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4432 mSDsluCounter, 6738 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6314 mSDsCounter, 1364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10469 IncrementalHoareTripleChecker+Invalid, 11833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1364 mSolverCounterUnsat, 424 mSDtfsCounter, 10469 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1834occurred in iteration=38, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 8464 NumberOfCodeBlocks, 8464 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 8418 ConstructedInterpolants, 0 QuantifiedInterpolants, 10508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 77 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 15:32:49,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE