./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/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d 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/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:00:52,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:00:52,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:00:52,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:00:52,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:00:52,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:00:52,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:00:52,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:00:52,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:00:52,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:00:52,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:00:52,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:00:52,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:00:52,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:00:52,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:00:52,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:00:52,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:00:52,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:00:52,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:00:52,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:00:52,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:00:52,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:00:52,439 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:00:52,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:00:52,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:00:52,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:00:52,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:00:52,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:00:52,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:00:52,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:00:52,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:00:52,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:52,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:00:52,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:00:52,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:00:52,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:00:52,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:00:52,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:00:52,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:00:52,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:00:52,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:00:52,443 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2024-10-13 10:00:52,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:00:52,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:00:52,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:00:52,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:00:52,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:00:52,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-10-13 10:00:54,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:00:54,373 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:00:54,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-10-13 10:00:54,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf23481c/464361ee267e492c8d840517b6f7a950/FLAGf5f158d75 [2024-10-13 10:00:54,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf23481c/464361ee267e492c8d840517b6f7a950 [2024-10-13 10:00:54,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:00:54,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:00:54,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:54,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:00:54,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:00:54,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:54" (1/1) ... [2024-10-13 10:00:54,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d41b7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:54, skipping insertion in model container [2024-10-13 10:00:54,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:54" (1/1) ... [2024-10-13 10:00:54,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:00:55,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:55,025 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:00:55,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:55,093 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:00:55,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55 WrapperNode [2024-10-13 10:00:55,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:55,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:55,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:00:55,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:00:55,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,144 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 410 [2024-10-13 10:00:55,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:55,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:00:55,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:00:55,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:00:55,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:00:55,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:00:55,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:00:55,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:00:55,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (1/1) ... [2024-10-13 10:00:55,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:55,312 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-13 10:00:55,314 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-13 10:00:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:00:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 10:00:55,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 10:00:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 10:00:55,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 10:00:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:00:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:00:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 10:00:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 10:00:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:00:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:00:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:00:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:00:55,357 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:00:55,474 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:00:55,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:00:56,089 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:00:56,089 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:00:56,521 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:00:56,521 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 10:00:56,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:56 BoogieIcfgContainer [2024-10-13 10:00:56,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:00:56,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:00:56,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:00:56,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:00:56,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:00:54" (1/3) ... [2024-10-13 10:00:56,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe08b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:56, skipping insertion in model container [2024-10-13 10:00:56,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:55" (2/3) ... [2024-10-13 10:00:56,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe08b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:56, skipping insertion in model container [2024-10-13 10:00:56,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:56" (3/3) ... [2024-10-13 10:00:56,530 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-10-13 10:00:56,549 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:00:56,549 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-13 10:00:56,549 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:00:56,635 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 10:00:56,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 326 transitions, 666 flow [2024-10-13 10:00:56,776 INFO L124 PetriNetUnfolderBase]: 13/324 cut-off events. [2024-10-13 10:00:56,776 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:00:56,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 324 events. 13/324 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 493 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 254. Up to 2 conditions per place. [2024-10-13 10:00:56,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 326 transitions, 666 flow [2024-10-13 10:00:56,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 307 transitions, 626 flow [2024-10-13 10:00:56,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:00:56,809 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;@6d40bd65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:00:56,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 115 error locations. [2024-10-13 10:00:56,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:00:56,817 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-13 10:00:56,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:00:56,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:56,819 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] [2024-10-13 10:00:56,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1838123497, now seen corresponding path program 1 times [2024-10-13 10:00:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660319905] [2024-10-13 10:00:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,013 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-13 10:00:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660319905] [2024-10-13 10:00:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660319905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:57,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401033733] [2024-10-13 10:00:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:57,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:57,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:57,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 326 [2024-10-13 10:00:57,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 307 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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-13 10:00:57,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:57,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 326 [2024-10-13 10:00:57,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:57,271 INFO L124 PetriNetUnfolderBase]: 27/412 cut-off events. [2024-10-13 10:00:57,272 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-13 10:00:57,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 412 events. 27/412 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1082 event pairs, 15 based on Foata normal form. 23/373 useless extension candidates. Maximal degree in co-relation 235. Up to 52 conditions per place. [2024-10-13 10:00:57,277 INFO L140 encePairwiseOnDemand]: 275/326 looper letters, 13 selfloop transitions, 2 changer transitions 4/258 dead transitions. [2024-10-13 10:00:57,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 258 transitions, 558 flow [2024-10-13 10:00:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2024-10-13 10:00:57,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8599182004089979 [2024-10-13 10:00:57,303 INFO L175 Difference]: Start difference. First operand has 302 places, 307 transitions, 626 flow. Second operand 3 states and 841 transitions. [2024-10-13 10:00:57,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 258 transitions, 558 flow [2024-10-13 10:00:57,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 550 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 10:00:57,316 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 516 flow [2024-10-13 10:00:57,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2024-10-13 10:00:57,324 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -43 predicate places. [2024-10-13 10:00:57,324 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 516 flow [2024-10-13 10:00:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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-13 10:00:57,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:57,325 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] [2024-10-13 10:00:57,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:00:57,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:57,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1538491648, now seen corresponding path program 1 times [2024-10-13 10:00:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:57,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855033933] [2024-10-13 10:00:57,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,402 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-13 10:00:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855033933] [2024-10-13 10:00:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855033933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967043488] [2024-10-13 10:00:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:57,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-13 10:00:57,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:57,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:57,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-13 10:00:57,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:57,507 INFO L124 PetriNetUnfolderBase]: 22/386 cut-off events. [2024-10-13 10:00:57,507 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 10:00:57,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 386 events. 22/386 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 860 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 399. Up to 38 conditions per place. [2024-10-13 10:00:57,511 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-10-13 10:00:57,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 253 transitions, 542 flow [2024-10-13 10:00:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-13 10:00:57,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-13 10:00:57,515 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 516 flow. Second operand 3 states and 795 transitions. [2024-10-13 10:00:57,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 253 transitions, 542 flow [2024-10-13 10:00:57,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 253 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:57,522 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 514 flow [2024-10-13 10:00:57,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2024-10-13 10:00:57,523 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -48 predicate places. [2024-10-13 10:00:57,523 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 514 flow [2024-10-13 10:00:57,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:57,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:57,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] [2024-10-13 10:00:57,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:00:57,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1000939298, now seen corresponding path program 1 times [2024-10-13 10:00:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164269148] [2024-10-13 10:00:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,585 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-13 10:00:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164269148] [2024-10-13 10:00:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164269148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898345205] [2024-10-13 10:00:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:57,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:57,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-13 10:00:57,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:57,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:57,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-13 10:00:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:57,711 INFO L124 PetriNetUnfolderBase]: 22/385 cut-off events. [2024-10-13 10:00:57,712 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 10:00:57,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 385 events. 22/385 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 861 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 390. Up to 38 conditions per place. [2024-10-13 10:00:57,717 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-10-13 10:00:57,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 252 transitions, 540 flow [2024-10-13 10:00:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-13 10:00:57,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-13 10:00:57,721 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 514 flow. Second operand 3 states and 795 transitions. [2024-10-13 10:00:57,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 252 transitions, 540 flow [2024-10-13 10:00:57,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 252 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:57,727 INFO L231 Difference]: Finished difference. Result has 253 places, 252 transitions, 512 flow [2024-10-13 10:00:57,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=253, PETRI_TRANSITIONS=252} [2024-10-13 10:00:57,728 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -49 predicate places. [2024-10-13 10:00:57,729 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 252 transitions, 512 flow [2024-10-13 10:00:57,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:57,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:57,731 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] [2024-10-13 10:00:57,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:00:57,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2004412426, now seen corresponding path program 1 times [2024-10-13 10:00:57,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:57,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855880173] [2024-10-13 10:00:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,805 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-13 10:00:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855880173] [2024-10-13 10:00:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855880173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:57,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:57,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403757272] [2024-10-13 10:00:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:57,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:57,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:57,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:57,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-13 10:00:57,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:57,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:57,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-13 10:00:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:57,904 INFO L124 PetriNetUnfolderBase]: 22/384 cut-off events. [2024-10-13 10:00:57,905 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 10:00:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 384 events. 22/384 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 861 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 381. Up to 38 conditions per place. [2024-10-13 10:00:57,907 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-10-13 10:00:57,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 251 transitions, 538 flow [2024-10-13 10:00:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-13 10:00:57,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-13 10:00:57,909 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 512 flow. Second operand 3 states and 795 transitions. [2024-10-13 10:00:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 251 transitions, 538 flow [2024-10-13 10:00:57,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 251 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:57,914 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 510 flow [2024-10-13 10:00:57,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2024-10-13 10:00:57,915 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-13 10:00:57,915 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 510 flow [2024-10-13 10:00:57,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:57,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:57,916 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] [2024-10-13 10:00:57,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:00:57,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:57,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1088211231, now seen corresponding path program 1 times [2024-10-13 10:00:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374125014] [2024-10-13 10:00:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,983 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-13 10:00:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374125014] [2024-10-13 10:00:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374125014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587530891] [2024-10-13 10:00:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:57,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-13 10:00:57,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:57,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:57,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-13 10:00:57,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,093 INFO L124 PetriNetUnfolderBase]: 23/408 cut-off events. [2024-10-13 10:00:58,094 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-13 10:00:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 408 events. 23/408 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1072 event pairs, 5 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 405. Up to 26 conditions per place. [2024-10-13 10:00:58,096 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 16 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-10-13 10:00:58,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 561 flow [2024-10-13 10:00:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2024-10-13 10:00:58,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292433537832311 [2024-10-13 10:00:58,099 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 510 flow. Second operand 3 states and 811 transitions. [2024-10-13 10:00:58,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 561 flow [2024-10-13 10:00:58,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:58,105 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 514 flow [2024-10-13 10:00:58,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2024-10-13 10:00:58,106 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-13 10:00:58,106 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 514 flow [2024-10-13 10:00:58,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:58,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,107 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] [2024-10-13 10:00:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:00:58,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2026420870, now seen corresponding path program 1 times [2024-10-13 10:00:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129158751] [2024-10-13 10:00:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:58,177 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-13 10:00:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129158751] [2024-10-13 10:00:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129158751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:58,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:58,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65068623] [2024-10-13 10:00:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:58,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:58,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-13 10:00:58,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:00:58,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-13 10:00:58,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,278 INFO L124 PetriNetUnfolderBase]: 27/453 cut-off events. [2024-10-13 10:00:58,278 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-13 10:00:58,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 453 events. 27/453 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1200 event pairs, 13 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 266. Up to 51 conditions per place. [2024-10-13 10:00:58,281 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-10-13 10:00:58,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 540 flow [2024-10-13 10:00:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 10:00:58,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-13 10:00:58,284 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 514 flow. Second operand 3 states and 797 transitions. [2024-10-13 10:00:58,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 540 flow [2024-10-13 10:00:58,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:58,289 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 514 flow [2024-10-13 10:00:58,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2024-10-13 10:00:58,290 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-13 10:00:58,290 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 514 flow [2024-10-13 10:00:58,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:00:58,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,292 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] [2024-10-13 10:00:58,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:00:58,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:58,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 740504393, now seen corresponding path program 1 times [2024-10-13 10:00:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983089507] [2024-10-13 10:00:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:58,350 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-13 10:00:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983089507] [2024-10-13 10:00:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983089507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697423580] [2024-10-13 10:00:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:58,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:58,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-13 10:00:58,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:58,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-13 10:00:58,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,436 INFO L124 PetriNetUnfolderBase]: 27/452 cut-off events. [2024-10-13 10:00:58,436 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 10:00:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 452 events. 27/452 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1201 event pairs, 13 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 457. Up to 52 conditions per place. [2024-10-13 10:00:58,439 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-10-13 10:00:58,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 249 transitions, 542 flow [2024-10-13 10:00:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-13 10:00:58,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-13 10:00:58,442 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 514 flow. Second operand 3 states and 795 transitions. [2024-10-13 10:00:58,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 249 transitions, 542 flow [2024-10-13 10:00:58,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:58,447 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 512 flow [2024-10-13 10:00:58,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2024-10-13 10:00:58,448 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-13 10:00:58,448 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 512 flow [2024-10-13 10:00:58,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-13 10:00:58,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,450 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] [2024-10-13 10:00:58,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:00:58,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:58,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 932099919, now seen corresponding path program 1 times [2024-10-13 10:00:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217535830] [2024-10-13 10:00:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:58,509 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-13 10:00:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217535830] [2024-10-13 10:00:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217535830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:58,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:58,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132746449] [2024-10-13 10:00:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:58,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-13 10:00:58,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:58,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-13 10:00:58,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,619 INFO L124 PetriNetUnfolderBase]: 31/495 cut-off events. [2024-10-13 10:00:58,619 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-13 10:00:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 495 events. 31/495 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1569 event pairs, 8 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 505. Up to 34 conditions per place. [2024-10-13 10:00:58,622 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 17 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-10-13 10:00:58,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 255 transitions, 568 flow [2024-10-13 10:00:58,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-13 10:00:58,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282208588957055 [2024-10-13 10:00:58,625 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 512 flow. Second operand 3 states and 810 transitions. [2024-10-13 10:00:58,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 255 transitions, 568 flow [2024-10-13 10:00:58,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:58,632 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 516 flow [2024-10-13 10:00:58,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2024-10-13 10:00:58,633 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-13 10:00:58,633 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 516 flow [2024-10-13 10:00:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:58,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,634 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] [2024-10-13 10:00:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:00:58,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -639437959, now seen corresponding path program 1 times [2024-10-13 10:00:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758641500] [2024-10-13 10:00:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:58,668 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-13 10:00:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758641500] [2024-10-13 10:00:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758641500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183901292] [2024-10-13 10:00:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:58,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-13 10:00:58,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:00:58,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-13 10:00:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,777 INFO L124 PetriNetUnfolderBase]: 31/494 cut-off events. [2024-10-13 10:00:58,777 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-13 10:00:58,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 494 events. 31/494 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1573 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 312. Up to 65 conditions per place. [2024-10-13 10:00:58,780 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-10-13 10:00:58,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 248 transitions, 544 flow [2024-10-13 10:00:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 10:00:58,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-13 10:00:58,782 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 516 flow. Second operand 3 states and 797 transitions. [2024-10-13 10:00:58,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 248 transitions, 544 flow [2024-10-13 10:00:58,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 248 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:58,786 INFO L231 Difference]: Finished difference. Result has 251 places, 248 transitions, 516 flow [2024-10-13 10:00:58,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=248} [2024-10-13 10:00:58,787 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-13 10:00:58,788 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 248 transitions, 516 flow [2024-10-13 10:00:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:00:58,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,789 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] [2024-10-13 10:00:58,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:00:58,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:58,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1315042951, now seen corresponding path program 1 times [2024-10-13 10:00:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238557111] [2024-10-13 10:00:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:58,817 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-13 10:00:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238557111] [2024-10-13 10:00:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238557111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:58,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:58,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179527067] [2024-10-13 10:00:58,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:58,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-13 10:00:58,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 248 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:58,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-13 10:00:58,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,897 INFO L124 PetriNetUnfolderBase]: 31/493 cut-off events. [2024-10-13 10:00:58,897 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:00:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 493 events. 31/493 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1565 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 508. Up to 63 conditions per place. [2024-10-13 10:00:58,900 INFO L140 encePairwiseOnDemand]: 324/326 looper letters, 12 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2024-10-13 10:00:58,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 247 transitions, 540 flow [2024-10-13 10:00:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-13 10:00:58,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220858895705522 [2024-10-13 10:00:58,903 INFO L175 Difference]: Start difference. First operand has 251 places, 248 transitions, 516 flow. Second operand 3 states and 804 transitions. [2024-10-13 10:00:58,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 247 transitions, 540 flow [2024-10-13 10:00:58,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 247 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:58,907 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 512 flow [2024-10-13 10:00:58,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2024-10-13 10:00:58,908 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -52 predicate places. [2024-10-13 10:00:58,909 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 512 flow [2024-10-13 10:00:58,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:58,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,910 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-13 10:00:58,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:00:58,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1481040239, now seen corresponding path program 1 times [2024-10-13 10:00:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160111609] [2024-10-13 10:00:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:59,475 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-13 10:00:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:59,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160111609] [2024-10-13 10:00:59,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160111609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:59,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:59,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159197262] [2024-10-13 10:00:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:59,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:59,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 326 [2024-10-13 10:00:59,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 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-13 10:00:59,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:59,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 326 [2024-10-13 10:00:59,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:59,726 INFO L124 PetriNetUnfolderBase]: 31/491 cut-off events. [2024-10-13 10:00:59,727 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:00:59,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 491 events. 31/491 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1572 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 529. Up to 78 conditions per place. [2024-10-13 10:00:59,730 INFO L140 encePairwiseOnDemand]: 314/326 looper letters, 26 selfloop transitions, 10 changer transitions 0/245 dead transitions. [2024-10-13 10:00:59,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 245 transitions, 580 flow [2024-10-13 10:00:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1476 transitions. [2024-10-13 10:00:59,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.754601226993865 [2024-10-13 10:00:59,734 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 512 flow. Second operand 6 states and 1476 transitions. [2024-10-13 10:00:59,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 245 transitions, 580 flow [2024-10-13 10:00:59,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 245 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:59,739 INFO L231 Difference]: Finished difference. Result has 252 places, 245 transitions, 527 flow [2024-10-13 10:00:59,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=252, PETRI_TRANSITIONS=245} [2024-10-13 10:00:59,740 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-13 10:00:59,740 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 245 transitions, 527 flow [2024-10-13 10:00:59,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 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-13 10:00:59,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:59,742 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-13 10:00:59,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:00:59,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:59,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 635319152, now seen corresponding path program 1 times [2024-10-13 10:00:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623894408] [2024-10-13 10:00:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:59,787 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-13 10:00:59,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623894408] [2024-10-13 10:00:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623894408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789247170] [2024-10-13 10:00:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:59,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:59,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-13 10:00:59,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 245 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:00:59,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:59,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-13 10:00:59,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:59,902 INFO L124 PetriNetUnfolderBase]: 31/490 cut-off events. [2024-10-13 10:00:59,903 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:00:59,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 490 events. 31/490 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1557 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 566. Up to 65 conditions per place. [2024-10-13 10:00:59,906 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-13 10:00:59,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 555 flow [2024-10-13 10:00:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 10:00:59,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-13 10:00:59,909 INFO L175 Difference]: Start difference. First operand has 252 places, 245 transitions, 527 flow. Second operand 3 states and 797 transitions. [2024-10-13 10:00:59,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 555 flow [2024-10-13 10:00:59,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 535 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:59,914 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 509 flow [2024-10-13 10:00:59,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=248, PETRI_TRANSITIONS=244} [2024-10-13 10:00:59,916 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -54 predicate places. [2024-10-13 10:00:59,916 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 509 flow [2024-10-13 10:00:59,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:00:59,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:59,917 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] [2024-10-13 10:00:59,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:00:59,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:00:59,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash -566549835, now seen corresponding path program 1 times [2024-10-13 10:00:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482112368] [2024-10-13 10:00:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:59,956 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-13 10:00:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482112368] [2024-10-13 10:00:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482112368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:59,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:59,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417174552] [2024-10-13 10:00:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:59,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:59,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-13 10:00:59,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 244 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:00:59,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:59,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-13 10:00:59,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,071 INFO L124 PetriNetUnfolderBase]: 31/489 cut-off events. [2024-10-13 10:01:00,072 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:01:00,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 489 events. 31/489 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1525 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 505. Up to 63 conditions per place. [2024-10-13 10:01:00,075 INFO L140 encePairwiseOnDemand]: 324/326 looper letters, 12 selfloop transitions, 1 changer transitions 0/243 dead transitions. [2024-10-13 10:01:00,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 243 transitions, 533 flow [2024-10-13 10:01:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-13 10:01:00,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220858895705522 [2024-10-13 10:01:00,078 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 509 flow. Second operand 3 states and 804 transitions. [2024-10-13 10:01:00,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 243 transitions, 533 flow [2024-10-13 10:01:00,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:00,082 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 505 flow [2024-10-13 10:01:00,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2024-10-13 10:01:00,084 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -55 predicate places. [2024-10-13 10:01:00,084 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 505 flow [2024-10-13 10:01:00,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-13 10:01:00,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:00,085 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-13 10:01:00,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:01:00,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:01:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1422886651, now seen corresponding path program 1 times [2024-10-13 10:01:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793636038] [2024-10-13 10:01:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:00,131 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-13 10:01:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:00,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793636038] [2024-10-13 10:01:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793636038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:00,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979138455] [2024-10-13 10:01:00,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:00,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:00,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-13 10:01:00,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:01:00,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:00,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-13 10:01:00,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,222 INFO L124 PetriNetUnfolderBase]: 31/488 cut-off events. [2024-10-13 10:01:00,222 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:01:00,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 488 events. 31/488 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1521 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 505. Up to 65 conditions per place. [2024-10-13 10:01:00,225 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-10-13 10:01:00,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 533 flow [2024-10-13 10:01:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 10:01:00,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-13 10:01:00,228 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 505 flow. Second operand 3 states and 797 transitions. [2024-10-13 10:01:00,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 533 flow [2024-10-13 10:01:00,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:00,233 INFO L231 Difference]: Finished difference. Result has 247 places, 242 transitions, 506 flow [2024-10-13 10:01:00,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=247, PETRI_TRANSITIONS=242} [2024-10-13 10:01:00,235 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -55 predicate places. [2024-10-13 10:01:00,235 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 242 transitions, 506 flow [2024-10-13 10:01:00,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:01:00,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:00,236 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] [2024-10-13 10:01:00,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:01:00,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:01:00,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -90226084, now seen corresponding path program 1 times [2024-10-13 10:01:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503275463] [2024-10-13 10:01:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:00,281 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-13 10:01:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503275463] [2024-10-13 10:01:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503275463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377899779] [2024-10-13 10:01:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:00,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 326 [2024-10-13 10:01:00,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 242 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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-13 10:01:00,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:00,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 326 [2024-10-13 10:01:00,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,409 INFO L124 PetriNetUnfolderBase]: 66/502 cut-off events. [2024-10-13 10:01:00,410 INFO L125 PetriNetUnfolderBase]: For 32/40 co-relation queries the response was YES. [2024-10-13 10:01:00,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 502 events. 66/502 cut-off events. For 32/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1679 event pairs, 8 based on Foata normal form. 2/451 useless extension candidates. Maximal degree in co-relation 616. Up to 108 conditions per place. [2024-10-13 10:01:00,412 INFO L140 encePairwiseOnDemand]: 319/326 looper letters, 16 selfloop transitions, 5 changer transitions 0/243 dead transitions. [2024-10-13 10:01:00,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 555 flow [2024-10-13 10:01:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-13 10:01:00,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-13 10:01:00,414 INFO L175 Difference]: Start difference. First operand has 247 places, 242 transitions, 506 flow. Second operand 3 states and 795 transitions. [2024-10-13 10:01:00,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 555 flow [2024-10-13 10:01:00,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 243 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:00,419 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 506 flow [2024-10-13 10:01:00,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-10-13 10:01:00,421 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -58 predicate places. [2024-10-13 10:01:00,421 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 506 flow [2024-10-13 10:01:00,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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-13 10:01:00,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:00,422 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] [2024-10-13 10:01:00,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:01:00,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:01:00,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash -807875329, now seen corresponding path program 1 times [2024-10-13 10:01:00,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275674111] [2024-10-13 10:01:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:00,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:00,467 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-13 10:01:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:00,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275674111] [2024-10-13 10:01:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275674111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40929454] [2024-10-13 10:01:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:00,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:00,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-13 10:01:00,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:01:00,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:00,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-13 10:01:00,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,585 INFO L124 PetriNetUnfolderBase]: 91/667 cut-off events. [2024-10-13 10:01:00,585 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-13 10:01:00,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 667 events. 91/667 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2738 event pairs, 56 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 848. Up to 179 conditions per place. [2024-10-13 10:01:00,589 INFO L140 encePairwiseOnDemand]: 322/326 looper letters, 16 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-10-13 10:01:00,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 240 transitions, 545 flow [2024-10-13 10:01:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-10-13 10:01:00,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8190184049079755 [2024-10-13 10:01:00,592 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 506 flow. Second operand 3 states and 801 transitions. [2024-10-13 10:01:00,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 240 transitions, 545 flow [2024-10-13 10:01:00,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:00,597 INFO L231 Difference]: Finished difference. Result has 243 places, 239 transitions, 506 flow [2024-10-13 10:01:00,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=243, PETRI_TRANSITIONS=239} [2024-10-13 10:01:00,598 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -59 predicate places. [2024-10-13 10:01:00,598 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 239 transitions, 506 flow [2024-10-13 10:01:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-13 10:01:00,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:00,599 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] [2024-10-13 10:01:00,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:01:00,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:01:00,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:00,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1859511202, now seen corresponding path program 1 times [2024-10-13 10:01:00,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:00,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801532662] [2024-10-13 10:01:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:00,653 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-13 10:01:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801532662] [2024-10-13 10:01:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801532662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:00,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420093376] [2024-10-13 10:01:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:00,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:00,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 326 [2024-10-13 10:01:00,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-13 10:01:00,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:00,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 326 [2024-10-13 10:01:00,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,772 INFO L124 PetriNetUnfolderBase]: 81/569 cut-off events. [2024-10-13 10:01:00,773 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-10-13 10:01:00,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 569 events. 81/569 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2105 event pairs, 16 based on Foata normal form. 4/528 useless extension candidates. Maximal degree in co-relation 726. Up to 113 conditions per place. [2024-10-13 10:01:00,776 INFO L140 encePairwiseOnDemand]: 319/326 looper letters, 13 selfloop transitions, 5 changer transitions 4/240 dead transitions. [2024-10-13 10:01:00,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 240 transitions, 553 flow [2024-10-13 10:01:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 794 transitions. [2024-10-13 10:01:00,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8118609406952966 [2024-10-13 10:01:00,779 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 506 flow. Second operand 3 states and 794 transitions. [2024-10-13 10:01:00,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 240 transitions, 553 flow [2024-10-13 10:01:00,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:00,784 INFO L231 Difference]: Finished difference. Result has 242 places, 232 transitions, 501 flow [2024-10-13 10:01:00,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=242, PETRI_TRANSITIONS=232} [2024-10-13 10:01:00,786 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -60 predicate places. [2024-10-13 10:01:00,786 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 232 transitions, 501 flow [2024-10-13 10:01:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-13 10:01:00,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:00,787 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] [2024-10-13 10:01:00,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:01:00,788 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:01:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -596019474, now seen corresponding path program 1 times [2024-10-13 10:01:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525915110] [2024-10-13 10:01:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:00,843 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-13 10:01:00,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:00,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525915110] [2024-10-13 10:01:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525915110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:00,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94715812] [2024-10-13 10:01:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:00,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:00,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-13 10:01:00,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 232 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 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-13 10:01:00,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:00,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-13 10:01:00,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,986 INFO L124 PetriNetUnfolderBase]: 74/624 cut-off events. [2024-10-13 10:01:00,987 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-13 10:01:00,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 624 events. 74/624 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2428 event pairs, 41 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 835. Up to 116 conditions per place. [2024-10-13 10:01:00,991 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 17 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-13 10:01:00,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 235 transitions, 554 flow [2024-10-13 10:01:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 10:01:00,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-13 10:01:00,993 INFO L175 Difference]: Start difference. First operand has 242 places, 232 transitions, 501 flow. Second operand 3 states and 797 transitions. [2024-10-13 10:01:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 235 transitions, 554 flow [2024-10-13 10:01:00,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 235 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:00,998 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 493 flow [2024-10-13 10:01:00,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2024-10-13 10:01:00,999 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -65 predicate places. [2024-10-13 10:01:00,999 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 493 flow [2024-10-13 10:01:01,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 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-13 10:01:01,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:01,000 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] [2024-10-13 10:01:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:01:01,000 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-13 10:01:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1268848396, now seen corresponding path program 1 times [2024-10-13 10:01:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756210091] [2024-10-13 10:01:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:01,059 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-13 10:01:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756210091] [2024-10-13 10:01:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756210091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26123341] [2024-10-13 10:01:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:01,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-13 10:01:01,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 231 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-13 10:01:01,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:01,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-13 10:01:01,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:01,163 INFO L124 PetriNetUnfolderBase]: 81/538 cut-off events. [2024-10-13 10:01:01,164 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-10-13 10:01:01,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 538 events. 81/538 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1975 event pairs, 48 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 692. Up to 129 conditions per place. [2024-10-13 10:01:01,166 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 0 selfloop transitions, 0 changer transitions 234/234 dead transitions. [2024-10-13 10:01:01,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 234 transitions, 542 flow [2024-10-13 10:01:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 10:01:01,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-13 10:01:01,169 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 493 flow. Second operand 3 states and 797 transitions. [2024-10-13 10:01:01,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 234 transitions, 542 flow [2024-10-13 10:01:01,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 234 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:01,172 INFO L231 Difference]: Finished difference. Result has 236 places, 0 transitions, 0 flow [2024-10-13 10:01:01,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=236, PETRI_TRANSITIONS=0} [2024-10-13 10:01:01,173 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -66 predicate places. [2024-10-13 10:01:01,173 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 0 transitions, 0 flow [2024-10-13 10:01:01,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-13 10:01:01,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 115 remaining) [2024-10-13 10:01:01,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (113 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (111 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (110 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (109 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (108 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (107 of 115 remaining) [2024-10-13 10:01:01,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (106 of 115 remaining) [2024-10-13 10:01:01,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (105 of 115 remaining) [2024-10-13 10:01:01,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 115 remaining) [2024-10-13 10:01:01,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 115 remaining) [2024-10-13 10:01:01,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 115 remaining) [2024-10-13 10:01:01,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (101 of 115 remaining) [2024-10-13 10:01:01,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (100 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (99 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (98 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (97 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (96 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (95 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (94 of 115 remaining) [2024-10-13 10:01:01,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (93 of 115 remaining) [2024-10-13 10:01:01,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (92 of 115 remaining) [2024-10-13 10:01:01,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (91 of 115 remaining) [2024-10-13 10:01:01,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 115 remaining) [2024-10-13 10:01:01,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 115 remaining) [2024-10-13 10:01:01,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 115 remaining) [2024-10-13 10:01:01,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 115 remaining) [2024-10-13 10:01:01,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 115 remaining) [2024-10-13 10:01:01,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (65 of 115 remaining) [2024-10-13 10:01:01,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (64 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (62 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (61 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (60 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (57 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (56 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (55 of 115 remaining) [2024-10-13 10:01:01,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (54 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (52 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (51 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (50 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 115 remaining) [2024-10-13 10:01:01,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 115 remaining) [2024-10-13 10:01:01,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 115 remaining) [2024-10-13 10:01:01,187 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (28 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (27 of 115 remaining) [2024-10-13 10:01:01,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (26 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (25 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (24 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 115 remaining) [2024-10-13 10:01:01,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 115 remaining) [2024-10-13 10:01:01,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (11 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (9 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (7 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (6 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (5 of 115 remaining) [2024-10-13 10:01:01,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (4 of 115 remaining) [2024-10-13 10:01:01,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (3 of 115 remaining) [2024-10-13 10:01:01,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 115 remaining) [2024-10-13 10:01:01,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 115 remaining) [2024-10-13 10:01:01,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 115 remaining) [2024-10-13 10:01:01,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:01:01,192 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] [2024-10-13 10:01:01,198 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 10:01:01,198 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:01:01,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:01:01 BasicIcfg [2024-10-13 10:01:01,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:01:01,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:01:01,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:01:01,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:01:01,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:56" (3/4) ... [2024-10-13 10:01:01,207 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:01:01,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 10:01:01,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 10:01:01,214 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-13 10:01:01,214 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:01:01,214 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:01:01,215 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:01:01,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:01:01,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:01:01,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:01:01,319 INFO L158 Benchmark]: Toolchain (without parser) took 6590.73ms. Allocated memory was 176.2MB in the beginning and 327.2MB in the end (delta: 151.0MB). Free memory was 106.5MB in the beginning and 179.6MB in the end (delta: -73.1MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,320 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 130.7MB in the beginning and 130.5MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:01,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.33ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 92.0MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.03ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 88.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,320 INFO L158 Benchmark]: Boogie Preprocessor took 65.96ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 86.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,320 INFO L158 Benchmark]: RCFGBuilder took 1310.60ms. Allocated memory is still 176.2MB. Free memory was 86.0MB in the beginning and 124.4MB in the end (delta: -38.5MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,321 INFO L158 Benchmark]: TraceAbstraction took 4680.02ms. Allocated memory was 176.2MB in the beginning and 327.2MB in the end (delta: 151.0MB). Free memory was 123.4MB in the beginning and 185.9MB in the end (delta: -62.6MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,321 INFO L158 Benchmark]: Witness Printer took 114.04ms. Allocated memory is still 327.2MB. Free memory was 185.9MB in the beginning and 179.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 10:01:01,323 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.20ms. Allocated memory is still 176.2MB. Free memory was 130.7MB in the beginning and 130.5MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.33ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 92.0MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.03ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 88.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.96ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 86.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1310.60ms. Allocated memory is still 176.2MB. Free memory was 86.0MB in the beginning and 124.4MB in the end (delta: -38.5MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4680.02ms. Allocated memory was 176.2MB in the beginning and 327.2MB in the end (delta: 151.0MB). Free memory was 123.4MB in the beginning and 185.9MB in the end (delta: -62.6MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 114.04ms. Allocated memory is still 327.2MB. Free memory was 185.9MB in the beginning and 179.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: 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: 49]: 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: 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: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 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: 69]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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: 89]: 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: 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: 92]: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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 5 procedures, 404 locations, 115 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: 4.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 69 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=0, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 65 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:01:01,354 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