./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-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 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-horseshoe.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 ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:14:32,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:14:32,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:14:32,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:14:32,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:14:32,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:14:32,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:14:32,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:14:32,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:14:32,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:14:32,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:14:32,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:14:32,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:14:32,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:14:32,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:14:32,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:14:32,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:14:32,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:14:32,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:14:32,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:14:32,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:14:32,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:14:32,343 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:14:32,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:14:32,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:14:32,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:14:32,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:14:32,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:14:32,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:14:32,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:14:32,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:14:32,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:14:32,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:14:32,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:14:32,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:14:32,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:14:32,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:14:32,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:14:32,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:14:32,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:14:32,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:14:32,351 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2024-10-14 17:14:32,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:14:32,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:14:32,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:14:32,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:14:32,614 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:14:32,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-10-14 17:14:34,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:14:34,216 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:14:34,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-10-14 17:14:34,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d67d92e8/66b06e9e7f1c4449bb60ea88d2088b0f/FLAG3338d3c6d [2024-10-14 17:14:34,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d67d92e8/66b06e9e7f1c4449bb60ea88d2088b0f [2024-10-14 17:14:34,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:14:34,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:14:34,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:14:34,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:14:34,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:14:34,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c8243c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34, skipping insertion in model container [2024-10-14 17:14:34,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:14:34,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:14:34,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:14:34,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:14:34,545 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:14:34,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34 WrapperNode [2024-10-14 17:14:34,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:14:34,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:14:34,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:14:34,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:14:34,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,600 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 460 [2024-10-14 17:14:34,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:14:34,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:14:34,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:14:34,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:14:34,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:14:34,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:14:34,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:14:34,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:14:34,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (1/1) ... [2024-10-14 17:14:34,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:14:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:14:34,707 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-14 17:14:34,709 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-14 17:14:34,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:14:34,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:14:34,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:14:34,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:14:34,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:14:34,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:14:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:14:34,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:14:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:14:34,752 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:14:34,867 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:14:34,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:14:35,615 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:14:35,615 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:14:36,048 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:14:36,050 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 17:14:36,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:14:36 BoogieIcfgContainer [2024-10-14 17:14:36,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:14:36,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:14:36,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:14:36,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:14:36,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:14:34" (1/3) ... [2024-10-14 17:14:36,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dff63a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:14:36, skipping insertion in model container [2024-10-14 17:14:36,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:34" (2/3) ... [2024-10-14 17:14:36,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dff63a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:14:36, skipping insertion in model container [2024-10-14 17:14:36,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:14:36" (3/3) ... [2024-10-14 17:14:36,060 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2024-10-14 17:14:36,081 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:14:36,083 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-14 17:14:36,083 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:14:36,188 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:14:36,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 355 transitions, 731 flow [2024-10-14 17:14:36,363 INFO L124 PetriNetUnfolderBase]: 18/352 cut-off events. [2024-10-14 17:14:36,364 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:14:36,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 352 events. 18/352 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 532 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 299. Up to 3 conditions per place. [2024-10-14 17:14:36,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 355 transitions, 731 flow [2024-10-14 17:14:36,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 335 transitions, 688 flow [2024-10-14 17:14:36,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:14:36,403 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;@2d09c732, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:14:36,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2024-10-14 17:14:36,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:14:36,411 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-10-14 17:14:36,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:14:36,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:36,413 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] [2024-10-14 17:14:36,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 278754752, now seen corresponding path program 1 times [2024-10-14 17:14:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:36,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079925988] [2024-10-14 17:14:36,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:36,613 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-14 17:14:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079925988] [2024-10-14 17:14:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079925988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:36,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751613527] [2024-10-14 17:14:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:36,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:36,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-14 17:14:36,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 335 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:36,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:36,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-14 17:14:36,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:36,918 INFO L124 PetriNetUnfolderBase]: 72/558 cut-off events. [2024-10-14 17:14:36,918 INFO L125 PetriNetUnfolderBase]: For 38/39 co-relation queries the response was YES. [2024-10-14 17:14:36,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 558 events. 72/558 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1935 event pairs, 38 based on Foata normal form. 57/532 useless extension candidates. Maximal degree in co-relation 422. Up to 109 conditions per place. [2024-10-14 17:14:36,927 INFO L140 encePairwiseOnDemand]: 296/355 looper letters, 15 selfloop transitions, 2 changer transitions 5/278 dead transitions. [2024-10-14 17:14:36,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 278 transitions, 608 flow [2024-10-14 17:14:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-10-14 17:14:36,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8525821596244132 [2024-10-14 17:14:36,951 INFO L175 Difference]: Start difference. First operand has 328 places, 335 transitions, 688 flow. Second operand 3 states and 908 transitions. [2024-10-14 17:14:36,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 278 transitions, 608 flow [2024-10-14 17:14:36,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 278 transitions, 596 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:14:36,964 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 556 flow [2024-10-14 17:14:36,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2024-10-14 17:14:36,969 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -49 predicate places. [2024-10-14 17:14:36,972 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 556 flow [2024-10-14 17:14:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:36,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:36,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:14:36,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:14:36,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -139595877, now seen corresponding path program 1 times [2024-10-14 17:14:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455740609] [2024-10-14 17:14:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:37,046 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-14 17:14:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:37,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455740609] [2024-10-14 17:14:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455740609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270440065] [2024-10-14 17:14:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:37,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:37,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:37,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-14 17:14:37,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:37,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:37,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-14 17:14:37,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:37,229 INFO L124 PetriNetUnfolderBase]: 75/601 cut-off events. [2024-10-14 17:14:37,230 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-10-14 17:14:37,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 601 events. 75/601 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2351 event pairs, 18 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 692. Up to 81 conditions per place. [2024-10-14 17:14:37,235 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 18 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-10-14 17:14:37,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 278 transitions, 608 flow [2024-10-14 17:14:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2024-10-14 17:14:37,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140845070422535 [2024-10-14 17:14:37,239 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 556 flow. Second operand 3 states and 867 transitions. [2024-10-14 17:14:37,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 278 transitions, 608 flow [2024-10-14 17:14:37,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 278 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:37,246 INFO L231 Difference]: Finished difference. Result has 274 places, 273 transitions, 560 flow [2024-10-14 17:14:37,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=274, PETRI_TRANSITIONS=273} [2024-10-14 17:14:37,248 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -54 predicate places. [2024-10-14 17:14:37,248 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 273 transitions, 560 flow [2024-10-14 17:14:37,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:37,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:37,249 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] [2024-10-14 17:14:37,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:14:37,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:37,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1946188924, now seen corresponding path program 1 times [2024-10-14 17:14:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:37,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446538432] [2024-10-14 17:14:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:37,324 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-14 17:14:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446538432] [2024-10-14 17:14:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446538432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:37,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559954331] [2024-10-14 17:14:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:37,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:37,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:37,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 273 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:37,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:37,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:37,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:37,484 INFO L124 PetriNetUnfolderBase]: 72/555 cut-off events. [2024-10-14 17:14:37,485 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-10-14 17:14:37,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 555 events. 72/555 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1966 event pairs, 38 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 329. Up to 110 conditions per place. [2024-10-14 17:14:37,490 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-10-14 17:14:37,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 272 transitions, 592 flow [2024-10-14 17:14:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-14 17:14:37,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-14 17:14:37,493 INFO L175 Difference]: Start difference. First operand has 274 places, 273 transitions, 560 flow. Second operand 3 states and 854 transitions. [2024-10-14 17:14:37,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 272 transitions, 592 flow [2024-10-14 17:14:37,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 590 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:14:37,500 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 560 flow [2024-10-14 17:14:37,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2024-10-14 17:14:37,502 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -54 predicate places. [2024-10-14 17:14:37,503 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 560 flow [2024-10-14 17:14:37,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:37,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:37,504 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-14 17:14:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:14:37,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:37,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash -158642187, now seen corresponding path program 1 times [2024-10-14 17:14:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373474744] [2024-10-14 17:14:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:37,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:37,570 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-14 17:14:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373474744] [2024-10-14 17:14:37,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373474744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:37,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352032346] [2024-10-14 17:14:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:37,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:37,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-14 17:14:37,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:37,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:37,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-14 17:14:37,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:37,725 INFO L124 PetriNetUnfolderBase]: 72/554 cut-off events. [2024-10-14 17:14:37,725 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-10-14 17:14:37,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 554 events. 72/554 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1970 event pairs, 38 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 663. Up to 111 conditions per place. [2024-10-14 17:14:37,731 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-10-14 17:14:37,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 271 transitions, 594 flow [2024-10-14 17:14:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-14 17:14:37,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-14 17:14:37,734 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 560 flow. Second operand 3 states and 852 transitions. [2024-10-14 17:14:37,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 271 transitions, 594 flow [2024-10-14 17:14:37,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 271 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:37,739 INFO L231 Difference]: Finished difference. Result has 273 places, 271 transitions, 558 flow [2024-10-14 17:14:37,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=273, PETRI_TRANSITIONS=271} [2024-10-14 17:14:37,740 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -55 predicate places. [2024-10-14 17:14:37,741 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 271 transitions, 558 flow [2024-10-14 17:14:37,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:37,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:37,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] [2024-10-14 17:14:37,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:14:37,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:37,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:37,743 INFO L85 PathProgramCache]: Analyzing trace with hash 575102513, now seen corresponding path program 1 times [2024-10-14 17:14:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:37,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519331853] [2024-10-14 17:14:37,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:37,800 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-14 17:14:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519331853] [2024-10-14 17:14:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519331853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:37,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:37,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:37,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941913467] [2024-10-14 17:14:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:37,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:37,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:37,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:37,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-14 17:14:37,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 271 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:37,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:37,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-14 17:14:37,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:37,958 INFO L124 PetriNetUnfolderBase]: 83/671 cut-off events. [2024-10-14 17:14:37,959 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-14 17:14:37,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 671 events. 83/671 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2738 event pairs, 20 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 782. Up to 66 conditions per place. [2024-10-14 17:14:37,964 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 21 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-10-14 17:14:37,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 278 transitions, 624 flow [2024-10-14 17:14:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2024-10-14 17:14:37,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8150234741784037 [2024-10-14 17:14:37,966 INFO L175 Difference]: Start difference. First operand has 273 places, 271 transitions, 558 flow. Second operand 3 states and 868 transitions. [2024-10-14 17:14:37,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 278 transitions, 624 flow [2024-10-14 17:14:37,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 278 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:37,971 INFO L231 Difference]: Finished difference. Result has 273 places, 271 transitions, 562 flow [2024-10-14 17:14:37,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=273, PETRI_TRANSITIONS=271} [2024-10-14 17:14:37,972 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -55 predicate places. [2024-10-14 17:14:37,973 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 271 transitions, 562 flow [2024-10-14 17:14:37,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:37,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:37,974 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-14 17:14:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:14:37,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:37,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -656606061, now seen corresponding path program 1 times [2024-10-14 17:14:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079231975] [2024-10-14 17:14:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:38,031 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-14 17:14:38,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:38,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079231975] [2024-10-14 17:14:38,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079231975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:38,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:38,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878148938] [2024-10-14 17:14:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:38,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:38,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 271 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:38,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:38,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:38,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:38,150 INFO L124 PetriNetUnfolderBase]: 83/567 cut-off events. [2024-10-14 17:14:38,151 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-10-14 17:14:38,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 567 events. 83/567 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2015 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 477. Up to 123 conditions per place. [2024-10-14 17:14:38,155 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-10-14 17:14:38,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 270 transitions, 596 flow [2024-10-14 17:14:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-14 17:14:38,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-14 17:14:38,159 INFO L175 Difference]: Start difference. First operand has 273 places, 271 transitions, 562 flow. Second operand 3 states and 854 transitions. [2024-10-14 17:14:38,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 270 transitions, 596 flow [2024-10-14 17:14:38,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 270 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:14:38,164 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 562 flow [2024-10-14 17:14:38,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-10-14 17:14:38,167 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -55 predicate places. [2024-10-14 17:14:38,167 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 562 flow [2024-10-14 17:14:38,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:38,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:38,169 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] [2024-10-14 17:14:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:14:38,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -634304093, now seen corresponding path program 1 times [2024-10-14 17:14:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482571409] [2024-10-14 17:14:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:38,213 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-14 17:14:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482571409] [2024-10-14 17:14:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482571409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:38,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047703476] [2024-10-14 17:14:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:38,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:38,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-14 17:14:38,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:38,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:38,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-14 17:14:38,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:38,352 INFO L124 PetriNetUnfolderBase]: 83/566 cut-off events. [2024-10-14 17:14:38,352 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-14 17:14:38,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 566 events. 83/566 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2010 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 699. Up to 124 conditions per place. [2024-10-14 17:14:38,356 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 17 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-10-14 17:14:38,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 269 transitions, 598 flow [2024-10-14 17:14:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-14 17:14:38,359 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-14 17:14:38,359 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 562 flow. Second operand 3 states and 852 transitions. [2024-10-14 17:14:38,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 269 transitions, 598 flow [2024-10-14 17:14:38,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 269 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:38,363 INFO L231 Difference]: Finished difference. Result has 272 places, 269 transitions, 560 flow [2024-10-14 17:14:38,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=272, PETRI_TRANSITIONS=269} [2024-10-14 17:14:38,365 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -56 predicate places. [2024-10-14 17:14:38,365 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 269 transitions, 560 flow [2024-10-14 17:14:38,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:38,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:38,366 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] [2024-10-14 17:14:38,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:14:38,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1772357456, now seen corresponding path program 1 times [2024-10-14 17:14:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457476362] [2024-10-14 17:14:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:38,414 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-14 17:14:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:38,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457476362] [2024-10-14 17:14:38,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457476362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:38,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:38,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:38,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541500251] [2024-10-14 17:14:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:38,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-14 17:14:38,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 269 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:38,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:38,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-14 17:14:38,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:38,518 INFO L124 PetriNetUnfolderBase]: 83/565 cut-off events. [2024-10-14 17:14:38,518 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-10-14 17:14:38,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 565 events. 83/565 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2008 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 687. Up to 121 conditions per place. [2024-10-14 17:14:38,522 INFO L140 encePairwiseOnDemand]: 353/355 looper letters, 15 selfloop transitions, 1 changer transitions 0/268 dead transitions. [2024-10-14 17:14:38,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 590 flow [2024-10-14 17:14:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-10-14 17:14:38,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084507042253521 [2024-10-14 17:14:38,525 INFO L175 Difference]: Start difference. First operand has 272 places, 269 transitions, 560 flow. Second operand 3 states and 861 transitions. [2024-10-14 17:14:38,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 590 flow [2024-10-14 17:14:38,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:38,529 INFO L231 Difference]: Finished difference. Result has 271 places, 268 transitions, 556 flow [2024-10-14 17:14:38,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=271, PETRI_TRANSITIONS=268} [2024-10-14 17:14:38,531 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-10-14 17:14:38,531 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 268 transitions, 556 flow [2024-10-14 17:14:38,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:38,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:38,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:14:38,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:14:38,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash -252123487, now seen corresponding path program 1 times [2024-10-14 17:14:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492142363] [2024-10-14 17:14:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:39,033 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-14 17:14:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492142363] [2024-10-14 17:14:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492142363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:39,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:39,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:14:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354424548] [2024-10-14 17:14:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:14:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:39,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:14:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:14:39,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 355 [2024-10-14 17:14:39,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 268 transitions, 556 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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-14 17:14:39,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:39,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 355 [2024-10-14 17:14:39,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:39,296 INFO L124 PetriNetUnfolderBase]: 83/563 cut-off events. [2024-10-14 17:14:39,297 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-14 17:14:39,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 563 events. 83/563 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2004 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 708. Up to 136 conditions per place. [2024-10-14 17:14:39,301 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 29 selfloop transitions, 10 changer transitions 0/266 dead transitions. [2024-10-14 17:14:39,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 266 transitions, 630 flow [2024-10-14 17:14:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:14:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:14:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1587 transitions. [2024-10-14 17:14:39,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7450704225352113 [2024-10-14 17:14:39,305 INFO L175 Difference]: Start difference. First operand has 271 places, 268 transitions, 556 flow. Second operand 6 states and 1587 transitions. [2024-10-14 17:14:39,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 266 transitions, 630 flow [2024-10-14 17:14:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 266 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:14:39,312 INFO L231 Difference]: Finished difference. Result has 273 places, 266 transitions, 571 flow [2024-10-14 17:14:39,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=273, PETRI_TRANSITIONS=266} [2024-10-14 17:14:39,338 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -55 predicate places. [2024-10-14 17:14:39,338 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 266 transitions, 571 flow [2024-10-14 17:14:39,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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-14 17:14:39,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:39,340 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] [2024-10-14 17:14:39,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:14:39,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:39,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash -668339875, now seen corresponding path program 1 times [2024-10-14 17:14:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606048827] [2024-10-14 17:14:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:39,401 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-14 17:14:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606048827] [2024-10-14 17:14:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606048827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:39,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:39,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662700927] [2024-10-14 17:14:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:39,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:39,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:39,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:39,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 266 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:39,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:39,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:39,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:39,537 INFO L124 PetriNetUnfolderBase]: 83/562 cut-off events. [2024-10-14 17:14:39,537 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-14 17:14:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 562 events. 83/562 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2003 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 730. Up to 123 conditions per place. [2024-10-14 17:14:39,541 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-10-14 17:14:39,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 265 transitions, 605 flow [2024-10-14 17:14:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-14 17:14:39,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-14 17:14:39,544 INFO L175 Difference]: Start difference. First operand has 273 places, 266 transitions, 571 flow. Second operand 3 states and 854 transitions. [2024-10-14 17:14:39,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 265 transitions, 605 flow [2024-10-14 17:14:39,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:14:39,549 INFO L231 Difference]: Finished difference. Result has 269 places, 265 transitions, 553 flow [2024-10-14 17:14:39,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=269, PETRI_TRANSITIONS=265} [2024-10-14 17:14:39,551 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -59 predicate places. [2024-10-14 17:14:39,551 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 265 transitions, 553 flow [2024-10-14 17:14:39,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:39,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:39,552 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] [2024-10-14 17:14:39,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:14:39,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash 533568576, now seen corresponding path program 1 times [2024-10-14 17:14:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939502376] [2024-10-14 17:14:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:39,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:39,594 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-14 17:14:39,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:39,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939502376] [2024-10-14 17:14:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939502376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:39,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:39,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594382459] [2024-10-14 17:14:39,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:39,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-14 17:14:39,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 265 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:39,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:39,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-14 17:14:39,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:39,703 INFO L124 PetriNetUnfolderBase]: 83/561 cut-off events. [2024-10-14 17:14:39,703 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-14 17:14:39,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 561 events. 83/561 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2003 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 687. Up to 124 conditions per place. [2024-10-14 17:14:39,707 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 17 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-10-14 17:14:39,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 264 transitions, 589 flow [2024-10-14 17:14:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-14 17:14:39,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-14 17:14:39,710 INFO L175 Difference]: Start difference. First operand has 269 places, 265 transitions, 553 flow. Second operand 3 states and 852 transitions. [2024-10-14 17:14:39,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 264 transitions, 589 flow [2024-10-14 17:14:39,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 264 transitions, 585 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:39,715 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 551 flow [2024-10-14 17:14:39,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2024-10-14 17:14:39,716 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -60 predicate places. [2024-10-14 17:14:39,716 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 551 flow [2024-10-14 17:14:39,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-14 17:14:39,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:39,717 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] [2024-10-14 17:14:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:14:39,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:39,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 228360412, now seen corresponding path program 1 times [2024-10-14 17:14:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780319520] [2024-10-14 17:14:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:39,750 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-14 17:14:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780319520] [2024-10-14 17:14:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780319520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703284649] [2024-10-14 17:14:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:39,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:39,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-14 17:14:39,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:39,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:39,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-14 17:14:39,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:39,859 INFO L124 PetriNetUnfolderBase]: 83/560 cut-off events. [2024-10-14 17:14:39,859 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-10-14 17:14:39,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 560 events. 83/560 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2001 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 684. Up to 121 conditions per place. [2024-10-14 17:14:39,862 INFO L140 encePairwiseOnDemand]: 353/355 looper letters, 15 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2024-10-14 17:14:39,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 263 transitions, 581 flow [2024-10-14 17:14:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-10-14 17:14:39,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084507042253521 [2024-10-14 17:14:39,865 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 551 flow. Second operand 3 states and 861 transitions. [2024-10-14 17:14:39,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 263 transitions, 581 flow [2024-10-14 17:14:39,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:39,871 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 547 flow [2024-10-14 17:14:39,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2024-10-14 17:14:39,873 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -61 predicate places. [2024-10-14 17:14:39,874 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 547 flow [2024-10-14 17:14:39,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-14 17:14:39,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:39,875 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] [2024-10-14 17:14:39,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:14:39,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:39,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash 401590106, now seen corresponding path program 1 times [2024-10-14 17:14:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411359647] [2024-10-14 17:14:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:39,928 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-14 17:14:39,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411359647] [2024-10-14 17:14:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411359647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:39,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:39,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096647136] [2024-10-14 17:14:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:39,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:39,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:39,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:40,041 INFO L124 PetriNetUnfolderBase]: 83/559 cut-off events. [2024-10-14 17:14:40,042 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-14 17:14:40,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 559 events. 83/559 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1997 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 683. Up to 123 conditions per place. [2024-10-14 17:14:40,047 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2024-10-14 17:14:40,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 581 flow [2024-10-14 17:14:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-14 17:14:40,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-14 17:14:40,049 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 547 flow. Second operand 3 states and 854 transitions. [2024-10-14 17:14:40,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 581 flow [2024-10-14 17:14:40,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 262 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:14:40,054 INFO L231 Difference]: Finished difference. Result has 267 places, 262 transitions, 548 flow [2024-10-14 17:14:40,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=267, PETRI_TRANSITIONS=262} [2024-10-14 17:14:40,055 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -61 predicate places. [2024-10-14 17:14:40,056 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 262 transitions, 548 flow [2024-10-14 17:14:40,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-14 17:14:40,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:40,057 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] [2024-10-14 17:14:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:14:40,057 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:40,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1556024338, now seen corresponding path program 1 times [2024-10-14 17:14:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503626873] [2024-10-14 17:14:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:40,101 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-14 17:14:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503626873] [2024-10-14 17:14:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503626873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:40,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:40,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:40,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923169213] [2024-10-14 17:14:40,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:40,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:40,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 355 [2024-10-14 17:14:40,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 262 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 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-14 17:14:40,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:40,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 355 [2024-10-14 17:14:40,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:40,216 INFO L124 PetriNetUnfolderBase]: 93/610 cut-off events. [2024-10-14 17:14:40,216 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-10-14 17:14:40,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 610 events. 93/610 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2332 event pairs, 51 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 773. Up to 144 conditions per place. [2024-10-14 17:14:40,221 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 18 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-10-14 17:14:40,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 261 transitions, 586 flow [2024-10-14 17:14:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 850 transitions. [2024-10-14 17:14:40,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981220657276995 [2024-10-14 17:14:40,223 INFO L175 Difference]: Start difference. First operand has 267 places, 262 transitions, 548 flow. Second operand 3 states and 850 transitions. [2024-10-14 17:14:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 261 transitions, 586 flow [2024-10-14 17:14:40,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 261 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:40,227 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 546 flow [2024-10-14 17:14:40,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2024-10-14 17:14:40,228 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -62 predicate places. [2024-10-14 17:14:40,229 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 546 flow [2024-10-14 17:14:40,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 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-14 17:14:40,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:40,230 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] [2024-10-14 17:14:40,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:14:40,230 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1851010157, now seen corresponding path program 1 times [2024-10-14 17:14:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027745903] [2024-10-14 17:14:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:40,289 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-14 17:14:40,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027745903] [2024-10-14 17:14:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027745903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:40,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:40,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131811264] [2024-10-14 17:14:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:40,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:40,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:40,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:40,301 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:40,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 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-14 17:14:40,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:40,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:40,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:40,402 INFO L124 PetriNetUnfolderBase]: 112/670 cut-off events. [2024-10-14 17:14:40,402 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-14 17:14:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 670 events. 112/670 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2847 event pairs, 64 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 876. Up to 170 conditions per place. [2024-10-14 17:14:40,407 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 17 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2024-10-14 17:14:40,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 259 transitions, 578 flow [2024-10-14 17:14:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2024-10-14 17:14:40,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8028169014084507 [2024-10-14 17:14:40,409 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 546 flow. Second operand 3 states and 855 transitions. [2024-10-14 17:14:40,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 259 transitions, 578 flow [2024-10-14 17:14:40,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 259 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:40,413 INFO L231 Difference]: Finished difference. Result has 264 places, 259 transitions, 540 flow [2024-10-14 17:14:40,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=264, PETRI_TRANSITIONS=259} [2024-10-14 17:14:40,414 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -64 predicate places. [2024-10-14 17:14:40,415 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 259 transitions, 540 flow [2024-10-14 17:14:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 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-14 17:14:40,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:40,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:14:40,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:14:40,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:40,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1047376933, now seen corresponding path program 1 times [2024-10-14 17:14:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909756400] [2024-10-14 17:14:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:40,470 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-14 17:14:40,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:40,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909756400] [2024-10-14 17:14:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909756400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832783959] [2024-10-14 17:14:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:40,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:40,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:40,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:40,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:40,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:40,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 259 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-14 17:14:40,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:40,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:40,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:40,601 INFO L124 PetriNetUnfolderBase]: 158/621 cut-off events. [2024-10-14 17:14:40,601 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-10-14 17:14:40,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 621 events. 158/621 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2306 event pairs, 53 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 885. Up to 156 conditions per place. [2024-10-14 17:14:40,606 INFO L140 encePairwiseOnDemand]: 350/355 looper letters, 21 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2024-10-14 17:14:40,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 263 transitions, 602 flow [2024-10-14 17:14:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-10-14 17:14:40,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8075117370892019 [2024-10-14 17:14:40,609 INFO L175 Difference]: Start difference. First operand has 264 places, 259 transitions, 540 flow. Second operand 3 states and 860 transitions. [2024-10-14 17:14:40,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 263 transitions, 602 flow [2024-10-14 17:14:40,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 263 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:14:40,613 INFO L231 Difference]: Finished difference. Result has 263 places, 257 transitions, 541 flow [2024-10-14 17:14:40,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=263, PETRI_TRANSITIONS=257} [2024-10-14 17:14:40,614 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -65 predicate places. [2024-10-14 17:14:40,614 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 257 transitions, 541 flow [2024-10-14 17:14:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-14 17:14:40,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:40,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:14:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:14:40,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 762712744, now seen corresponding path program 1 times [2024-10-14 17:14:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751217184] [2024-10-14 17:14:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:40,689 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-14 17:14:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751217184] [2024-10-14 17:14:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751217184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:40,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684624591] [2024-10-14 17:14:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:40,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:40,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:40,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:40,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 257 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-14 17:14:40,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:40,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:40,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:40,835 INFO L124 PetriNetUnfolderBase]: 208/661 cut-off events. [2024-10-14 17:14:40,836 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-10-14 17:14:40,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 661 events. 208/661 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2498 event pairs, 83 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 1041. Up to 229 conditions per place. [2024-10-14 17:14:40,840 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 23 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2024-10-14 17:14:40,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 262 transitions, 607 flow [2024-10-14 17:14:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-10-14 17:14:40,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8075117370892019 [2024-10-14 17:14:40,843 INFO L175 Difference]: Start difference. First operand has 263 places, 257 transitions, 541 flow. Second operand 3 states and 860 transitions. [2024-10-14 17:14:40,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 262 transitions, 607 flow [2024-10-14 17:14:40,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 262 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:40,847 INFO L231 Difference]: Finished difference. Result has 262 places, 256 transitions, 537 flow [2024-10-14 17:14:40,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=262, PETRI_TRANSITIONS=256} [2024-10-14 17:14:40,847 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -66 predicate places. [2024-10-14 17:14:40,848 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 256 transitions, 537 flow [2024-10-14 17:14:40,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-14 17:14:40,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:40,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:14:40,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:14:40,849 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -668506076, now seen corresponding path program 1 times [2024-10-14 17:14:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147039338] [2024-10-14 17:14:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:40,907 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-14 17:14:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147039338] [2024-10-14 17:14:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147039338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:40,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:40,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811235955] [2024-10-14 17:14:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:40,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:40,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:40,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:40,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:40,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 256 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-14 17:14:40,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:40,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:40,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:41,086 INFO L124 PetriNetUnfolderBase]: 167/731 cut-off events. [2024-10-14 17:14:41,086 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2024-10-14 17:14:41,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 731 events. 167/731 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3169 event pairs, 56 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 1020. Up to 161 conditions per place. [2024-10-14 17:14:41,091 INFO L140 encePairwiseOnDemand]: 350/355 looper letters, 20 selfloop transitions, 2 changer transitions 4/261 dead transitions. [2024-10-14 17:14:41,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 261 transitions, 601 flow [2024-10-14 17:14:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-10-14 17:14:41,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8075117370892019 [2024-10-14 17:14:41,094 INFO L175 Difference]: Start difference. First operand has 262 places, 256 transitions, 537 flow. Second operand 3 states and 860 transitions. [2024-10-14 17:14:41,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 261 transitions, 601 flow [2024-10-14 17:14:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 261 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:41,098 INFO L231 Difference]: Finished difference. Result has 260 places, 250 transitions, 524 flow [2024-10-14 17:14:41,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=260, PETRI_TRANSITIONS=250} [2024-10-14 17:14:41,099 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -68 predicate places. [2024-10-14 17:14:41,099 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 250 transitions, 524 flow [2024-10-14 17:14:41,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-14 17:14:41,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:14:41,100 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:14:41,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:14:41,100 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-14 17:14:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:14:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash 724913767, now seen corresponding path program 1 times [2024-10-14 17:14:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:14:41,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289461466] [2024-10-14 17:14:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:14:41,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:14:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:14:41,176 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-14 17:14:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:14:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289461466] [2024-10-14 17:14:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289461466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:14:41,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:14:41,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:14:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472747685] [2024-10-14 17:14:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:14:41,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:14:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:14:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:14:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:14:41,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-14 17:14:41,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 250 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-14 17:14:41,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:14:41,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-14 17:14:41,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:14:41,349 INFO L124 PetriNetUnfolderBase]: 223/771 cut-off events. [2024-10-14 17:14:41,349 INFO L125 PetriNetUnfolderBase]: For 130/156 co-relation queries the response was YES. [2024-10-14 17:14:41,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 771 events. 223/771 cut-off events. For 130/156 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3389 event pairs, 92 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 1162. Up to 242 conditions per place. [2024-10-14 17:14:41,352 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 0 selfloop transitions, 0 changer transitions 256/256 dead transitions. [2024-10-14 17:14:41,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 256 transitions, 590 flow [2024-10-14 17:14:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:14:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:14:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-10-14 17:14:41,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8065727699530516 [2024-10-14 17:14:41,355 INFO L175 Difference]: Start difference. First operand has 260 places, 250 transitions, 524 flow. Second operand 3 states and 859 transitions. [2024-10-14 17:14:41,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 256 transitions, 590 flow [2024-10-14 17:14:41,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 256 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:14:41,358 INFO L231 Difference]: Finished difference. Result has 255 places, 0 transitions, 0 flow [2024-10-14 17:14:41,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=255, PETRI_TRANSITIONS=0} [2024-10-14 17:14:41,359 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -73 predicate places. [2024-10-14 17:14:41,359 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 0 transitions, 0 flow [2024-10-14 17:14:41,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-14 17:14:41,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2024-10-14 17:14:41,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2024-10-14 17:14:41,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2024-10-14 17:14:41,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2024-10-14 17:14:41,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2024-10-14 17:14:41,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2024-10-14 17:14:41,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2024-10-14 17:14:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2024-10-14 17:14:41,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2024-10-14 17:14:41,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2024-10-14 17:14:41,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2024-10-14 17:14:41,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2024-10-14 17:14:41,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2024-10-14 17:14:41,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2024-10-14 17:14:41,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2024-10-14 17:14:41,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2024-10-14 17:14:41,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2024-10-14 17:14:41,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2024-10-14 17:14:41,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2024-10-14 17:14:41,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2024-10-14 17:14:41,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2024-10-14 17:14:41,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2024-10-14 17:14:41,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2024-10-14 17:14:41,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2024-10-14 17:14:41,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2024-10-14 17:14:41,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2024-10-14 17:14:41,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2024-10-14 17:14:41,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2024-10-14 17:14:41,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2024-10-14 17:14:41,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2024-10-14 17:14:41,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2024-10-14 17:14:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:14:41,382 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-14 17:14:41,389 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:14:41,389 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:14:41,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:14:41 BasicIcfg [2024-10-14 17:14:41,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:14:41,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:14:41,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:14:41,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:14:41,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:14:36" (3/4) ... [2024-10-14 17:14:41,398 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:14:41,401 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:14:41,401 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:14:41,401 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 17:14:41,409 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-14 17:14:41,410 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:14:41,410 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:14:41,411 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:14:41,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:14:41,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:14:41,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:14:41,510 INFO L158 Benchmark]: Toolchain (without parser) took 7265.78ms. Allocated memory was 169.9MB in the beginning and 364.9MB in the end (delta: 195.0MB). Free memory was 101.3MB in the beginning and 190.0MB in the end (delta: -88.8MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,510 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:14:41,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.42ms. Allocated memory is still 169.9MB. Free memory was 100.9MB in the beginning and 86.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.48ms. Allocated memory is still 169.9MB. Free memory was 86.9MB in the beginning and 83.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,511 INFO L158 Benchmark]: Boogie Preprocessor took 69.81ms. Allocated memory is still 169.9MB. Free memory was 83.3MB in the beginning and 80.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,512 INFO L158 Benchmark]: RCFGBuilder took 1379.52ms. Allocated memory is still 169.9MB. Free memory was 80.3MB in the beginning and 111.7MB in the end (delta: -31.3MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,512 INFO L158 Benchmark]: TraceAbstraction took 5342.64ms. Allocated memory was 169.9MB in the beginning and 364.9MB in the end (delta: 195.0MB). Free memory was 111.7MB in the beginning and 196.3MB in the end (delta: -84.7MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,512 INFO L158 Benchmark]: Witness Printer took 113.58ms. Allocated memory is still 364.9MB. Free memory was 196.3MB in the beginning and 190.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:14:41,513 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.18ms. Allocated memory is still 117.4MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.42ms. Allocated memory is still 169.9MB. Free memory was 100.9MB in the beginning and 86.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.48ms. Allocated memory is still 169.9MB. Free memory was 86.9MB in the beginning and 83.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.81ms. Allocated memory is still 169.9MB. Free memory was 83.3MB in the beginning and 80.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1379.52ms. Allocated memory is still 169.9MB. Free memory was 80.3MB in the beginning and 111.7MB in the end (delta: -31.3MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5342.64ms. Allocated memory was 169.9MB in the beginning and 364.9MB in the end (delta: 195.0MB). Free memory was 111.7MB in the beginning and 196.3MB in the end (delta: -84.7MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * Witness Printer took 113.58ms. Allocated memory is still 364.9MB. Free memory was 196.3MB in the beginning and 190.0MB 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 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: 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: 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: 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: 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: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: 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: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 435 locations, 119 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: 5.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 723 IncrementalHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 55 mSDtfsCounter, 723 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=688occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1861 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 1993 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 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:14:41,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE