./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/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:10:40,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:10:40,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:10:40,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:10:40,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:10:40,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:10:40,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:10:40,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:10:40,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:10:40,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:10:40,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:10:40,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:10:40,484 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:10:40,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:10:40,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:10:40,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:10:40,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:10:40,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:10:40,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:10:40,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:10:40,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:10:40,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:10:40,487 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:10:40,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:10:40,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:10:40,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:10:40,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:10:40,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:10:40,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:10:40,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:10:40,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:10:40,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:40,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:10:40,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:10:40,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:10:40,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:10:40,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:10:40,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:10:40,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:10:40,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:10:40,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:10:40,493 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-clean/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-clean/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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2024-10-11 17:10:40,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:10:40,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:10:40,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:10:40,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:10:40,705 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:10:40,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-10-11 17:10:41,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:10:42,109 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:10:42,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-10-11 17:10:42,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6a62c450c/0d48423a95dd40adaf1435be9a761247/FLAG32602787b [2024-10-11 17:10:42,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6a62c450c/0d48423a95dd40adaf1435be9a761247 [2024-10-11 17:10:42,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:10:42,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:10:42,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:42,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:10:42,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:10:42,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8cd7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42, skipping insertion in model container [2024-10-11 17:10:42,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:10:42,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:42,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:10:42,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:42,885 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:10:42,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42 WrapperNode [2024-10-11 17:10:42,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:42,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:42,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:10:42,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:10:42,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,919 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 175 [2024-10-11 17:10:42,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:42,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:10:42,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:10:42,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:10:42,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:10:42,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:10:42,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:10:42,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:10:42,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (1/1) ... [2024-10-11 17:10:42,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:42,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:42,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:10:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:10:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:10:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:10:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:10:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:10:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:10:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:10:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:10:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:10:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:10:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:10:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:10:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:10:43,025 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:10:43,124 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:10:43,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:10:43,322 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:10:43,323 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:10:43,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:10:43,345 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 17:10:43,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:43 BoogieIcfgContainer [2024-10-11 17:10:43,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:10:43,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:10:43,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:10:43,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:10:43,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:10:42" (1/3) ... [2024-10-11 17:10:43,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c67506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:43, skipping insertion in model container [2024-10-11 17:10:43,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:42" (2/3) ... [2024-10-11 17:10:43,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c67506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:43, skipping insertion in model container [2024-10-11 17:10:43,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:43" (3/3) ... [2024-10-11 17:10:43,354 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2024-10-11 17:10:43,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:10:43,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 17:10:43,367 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:10:43,419 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:10:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 184 transitions, 375 flow [2024-10-11 17:10:43,554 INFO L124 PetriNetUnfolderBase]: 27/294 cut-off events. [2024-10-11 17:10:43,554 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:10:43,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 294 events. 27/294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 977 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2024-10-11 17:10:43,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 184 transitions, 375 flow [2024-10-11 17:10:43,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 184 transitions, 375 flow [2024-10-11 17:10:43,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:43,584 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;@1efe9221, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:43,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 17:10:43,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:43,598 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-10-11 17:10:43,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:43,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:43,599 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:43,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:10:43,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1043798880, now seen corresponding path program 1 times [2024-10-11 17:10:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846383245] [2024-10-11 17:10:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:44,311 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-11 17:10:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846383245] [2024-10-11 17:10:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846383245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:44,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:44,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916262437] [2024-10-11 17:10:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:44,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 184 [2024-10-11 17:10:44,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 184 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 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-11 17:10:44,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:44,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 184 [2024-10-11 17:10:44,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:44,619 INFO L124 PetriNetUnfolderBase]: 93/760 cut-off events. [2024-10-11 17:10:44,620 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:10:44,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 760 events. 93/760 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4265 event pairs, 8 based on Foata normal form. 101/803 useless extension candidates. Maximal degree in co-relation 799. Up to 154 conditions per place. [2024-10-11 17:10:44,627 INFO L140 encePairwiseOnDemand]: 165/184 looper letters, 40 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2024-10-11 17:10:44,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 184 transitions, 465 flow [2024-10-11 17:10:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2024-10-11 17:10:44,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8288043478260869 [2024-10-11 17:10:44,647 INFO L175 Difference]: Start difference. First operand has 171 places, 184 transitions, 375 flow. Second operand 6 states and 915 transitions. [2024-10-11 17:10:44,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 184 transitions, 465 flow [2024-10-11 17:10:44,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 184 transitions, 465 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:44,654 INFO L231 Difference]: Finished difference. Result has 173 places, 168 transitions, 353 flow [2024-10-11 17:10:44,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=173, PETRI_TRANSITIONS=168} [2024-10-11 17:10:44,659 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 2 predicate places. [2024-10-11 17:10:44,661 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 168 transitions, 353 flow [2024-10-11 17:10:44,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 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-11 17:10:44,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:44,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:44,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:10:44,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:10:44,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1196578425, now seen corresponding path program 1 times [2024-10-11 17:10:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688651405] [2024-10-11 17:10:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:44,702 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-11 17:10:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688651405] [2024-10-11 17:10:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688651405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:44,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:44,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480043752] [2024-10-11 17:10:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:44,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:44,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:44,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:44,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 184 [2024-10-11 17:10:44,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 168 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-11 17:10:44,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:44,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 184 [2024-10-11 17:10:44,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:44,830 INFO L124 PetriNetUnfolderBase]: 113/929 cut-off events. [2024-10-11 17:10:44,831 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2024-10-11 17:10:44,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 929 events. 113/929 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4849 event pairs, 34 based on Foata normal form. 1/852 useless extension candidates. Maximal degree in co-relation 1029. Up to 137 conditions per place. [2024-10-11 17:10:44,838 INFO L140 encePairwiseOnDemand]: 175/184 looper letters, 30 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2024-10-11 17:10:44,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 181 transitions, 454 flow [2024-10-11 17:10:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2024-10-11 17:10:44,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2024-10-11 17:10:44,840 INFO L175 Difference]: Start difference. First operand has 173 places, 168 transitions, 353 flow. Second operand 3 states and 480 transitions. [2024-10-11 17:10:44,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 181 transitions, 454 flow [2024-10-11 17:10:44,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 181 transitions, 444 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:44,845 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 381 flow [2024-10-11 17:10:44,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=170, PETRI_TRANSITIONS=170} [2024-10-11 17:10:44,846 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, -1 predicate places. [2024-10-11 17:10:44,846 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 381 flow [2024-10-11 17:10:44,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-11 17:10:44,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:44,847 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:10:44,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:10:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2008024647, now seen corresponding path program 1 times [2024-10-11 17:10:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5919752] [2024-10-11 17:10:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:44,892 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-11 17:10:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5919752] [2024-10-11 17:10:44,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5919752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:44,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48552090] [2024-10-11 17:10:44,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:44,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:44,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:44,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 184 [2024-10-11 17:10:44,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 170 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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-11 17:10:44,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:44,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 184 [2024-10-11 17:10:44,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:45,003 INFO L124 PetriNetUnfolderBase]: 82/911 cut-off events. [2024-10-11 17:10:45,003 INFO L125 PetriNetUnfolderBase]: For 34/36 co-relation queries the response was YES. [2024-10-11 17:10:45,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 911 events. 82/911 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4731 event pairs, 38 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 1041. Up to 146 conditions per place. [2024-10-11 17:10:45,008 INFO L140 encePairwiseOnDemand]: 181/184 looper letters, 20 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2024-10-11 17:10:45,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 174 transitions, 433 flow [2024-10-11 17:10:45,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2024-10-11 17:10:45,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8677536231884058 [2024-10-11 17:10:45,011 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 381 flow. Second operand 3 states and 479 transitions. [2024-10-11 17:10:45,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 174 transitions, 433 flow [2024-10-11 17:10:45,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 174 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:45,015 INFO L231 Difference]: Finished difference. Result has 171 places, 170 transitions, 377 flow [2024-10-11 17:10:45,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=171, PETRI_TRANSITIONS=170} [2024-10-11 17:10:45,017 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2024-10-11 17:10:45,017 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 170 transitions, 377 flow [2024-10-11 17:10:45,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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-11 17:10:45,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:45,018 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:45,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:10:45,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:10:45,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -138539635, now seen corresponding path program 1 times [2024-10-11 17:10:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:45,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489068212] [2024-10-11 17:10:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:45,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:45,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:45,083 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:45,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-11 17:10:45,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-11 17:10:45,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-11 17:10:45,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-11 17:10:45,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-11 17:10:45,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-11 17:10:45,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-11 17:10:45,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-11 17:10:45,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-11 17:10:45,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:10:45,088 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 17:10:45,090 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:45,090 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:10:45,109 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:10:45,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 216 transitions, 448 flow [2024-10-11 17:10:45,156 INFO L124 PetriNetUnfolderBase]: 45/464 cut-off events. [2024-10-11 17:10:45,156 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:45,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 464 events. 45/464 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1844 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 296. Up to 9 conditions per place. [2024-10-11 17:10:45,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 216 transitions, 448 flow [2024-10-11 17:10:45,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 216 transitions, 448 flow [2024-10-11 17:10:45,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:45,163 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;@1efe9221, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:45,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 17:10:45,167 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:45,168 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-10-11 17:10:45,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:45,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:45,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:45,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:10:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -604353992, now seen corresponding path program 1 times [2024-10-11 17:10:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584464941] [2024-10-11 17:10:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:45,348 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-11 17:10:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584464941] [2024-10-11 17:10:45,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584464941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:45,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:45,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:45,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281541712] [2024-10-11 17:10:45,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:45,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:45,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:45,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 216 [2024-10-11 17:10:45,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 216 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 162.5) internal successors, (975), 6 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-11 17:10:45,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:45,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 216 [2024-10-11 17:10:45,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:45,854 INFO L124 PetriNetUnfolderBase]: 1001/4603 cut-off events. [2024-10-11 17:10:45,855 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 17:10:45,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6262 conditions, 4603 events. 1001/4603 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43066 event pairs, 108 based on Foata normal form. 915/5185 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2024-10-11 17:10:45,875 INFO L140 encePairwiseOnDemand]: 193/216 looper letters, 62 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2024-10-11 17:10:45,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 226 transitions, 602 flow [2024-10-11 17:10:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1083 transitions. [2024-10-11 17:10:45,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2024-10-11 17:10:45,877 INFO L175 Difference]: Start difference. First operand has 200 places, 216 transitions, 448 flow. Second operand 6 states and 1083 transitions. [2024-10-11 17:10:45,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 226 transitions, 602 flow [2024-10-11 17:10:45,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 226 transitions, 602 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:45,880 INFO L231 Difference]: Finished difference. Result has 200 places, 194 transitions, 414 flow [2024-10-11 17:10:45,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=200, PETRI_TRANSITIONS=194} [2024-10-11 17:10:45,881 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, 0 predicate places. [2024-10-11 17:10:45,881 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 194 transitions, 414 flow [2024-10-11 17:10:45,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 162.5) internal successors, (975), 6 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-11 17:10:45,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:45,882 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:45,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:10:45,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:10:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash -572343151, now seen corresponding path program 1 times [2024-10-11 17:10:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865775656] [2024-10-11 17:10:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:45,913 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-11 17:10:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:45,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865775656] [2024-10-11 17:10:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865775656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448093453] [2024-10-11 17:10:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:45,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:45,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 216 [2024-10-11 17:10:45,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 194 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-11 17:10:45,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:45,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 216 [2024-10-11 17:10:45,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:46,172 INFO L124 PetriNetUnfolderBase]: 498/2955 cut-off events. [2024-10-11 17:10:46,173 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-10-11 17:10:46,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 2955 events. 498/2955 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 25754 event pairs, 208 based on Foata normal form. 1/2689 useless extension candidates. Maximal degree in co-relation 772. Up to 817 conditions per place. [2024-10-11 17:10:46,185 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 27 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-10-11 17:10:46,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 199 transitions, 484 flow [2024-10-11 17:10:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2024-10-11 17:10:46,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2024-10-11 17:10:46,187 INFO L175 Difference]: Start difference. First operand has 200 places, 194 transitions, 414 flow. Second operand 3 states and 549 transitions. [2024-10-11 17:10:46,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 199 transitions, 484 flow [2024-10-11 17:10:46,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 199 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:46,191 INFO L231 Difference]: Finished difference. Result has 198 places, 195 transitions, 416 flow [2024-10-11 17:10:46,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=198, PETRI_TRANSITIONS=195} [2024-10-11 17:10:46,192 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, -2 predicate places. [2024-10-11 17:10:46,192 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 195 transitions, 416 flow [2024-10-11 17:10:46,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-11 17:10:46,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:46,193 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:10:46,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:10:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash 983805569, now seen corresponding path program 1 times [2024-10-11 17:10:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020597525] [2024-10-11 17:10:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:46,230 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-11 17:10:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:46,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020597525] [2024-10-11 17:10:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020597525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:46,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628034221] [2024-10-11 17:10:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:46,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:46,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:46,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 216 [2024-10-11 17:10:46,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 195 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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-11 17:10:46,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:46,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 216 [2024-10-11 17:10:46,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:46,929 INFO L124 PetriNetUnfolderBase]: 2100/8569 cut-off events. [2024-10-11 17:10:46,929 INFO L125 PetriNetUnfolderBase]: For 229/364 co-relation queries the response was YES. [2024-10-11 17:10:46,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12074 conditions, 8569 events. 2100/8569 cut-off events. For 229/364 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 85064 event pairs, 755 based on Foata normal form. 8/7779 useless extension candidates. Maximal degree in co-relation 12014. Up to 2123 conditions per place. [2024-10-11 17:10:46,968 INFO L140 encePairwiseOnDemand]: 204/216 looper letters, 45 selfloop transitions, 8 changer transitions 0/216 dead transitions. [2024-10-11 17:10:46,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 216 transitions, 575 flow [2024-10-11 17:10:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2024-10-11 17:10:46,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-10-11 17:10:46,971 INFO L175 Difference]: Start difference. First operand has 198 places, 195 transitions, 416 flow. Second operand 3 states and 552 transitions. [2024-10-11 17:10:46,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 216 transitions, 575 flow [2024-10-11 17:10:46,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 216 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:46,975 INFO L231 Difference]: Finished difference. Result has 199 places, 199 transitions, 470 flow [2024-10-11 17:10:46,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=199, PETRI_TRANSITIONS=199} [2024-10-11 17:10:46,977 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, -1 predicate places. [2024-10-11 17:10:46,977 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 199 transitions, 470 flow [2024-10-11 17:10:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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-11 17:10:46,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:46,978 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] [2024-10-11 17:10:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:10:46,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:10:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1806539198, now seen corresponding path program 1 times [2024-10-11 17:10:46,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:46,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133479947] [2024-10-11 17:10:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:46,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133479947] [2024-10-11 17:10:47,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133479947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:10:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567122103] [2024-10-11 17:10:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:47,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:47,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:10:47,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:10:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:47,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:10:47,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:10:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:10:47,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:10:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567122103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:47,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:10:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 17:10:47,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877800184] [2024-10-11 17:10:47,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:47,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:47,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 216 [2024-10-11 17:10:47,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 199 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 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-11 17:10:47,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:47,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 216 [2024-10-11 17:10:47,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:48,247 INFO L124 PetriNetUnfolderBase]: 2343/13194 cut-off events. [2024-10-11 17:10:48,248 INFO L125 PetriNetUnfolderBase]: For 566/570 co-relation queries the response was YES. [2024-10-11 17:10:48,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18243 conditions, 13194 events. 2343/13194 cut-off events. For 566/570 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 154890 event pairs, 1363 based on Foata normal form. 36/12169 useless extension candidates. Maximal degree in co-relation 16348. Up to 2189 conditions per place. [2024-10-11 17:10:48,304 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 37 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2024-10-11 17:10:48,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 214 transitions, 578 flow [2024-10-11 17:10:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2024-10-11 17:10:48,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8626543209876543 [2024-10-11 17:10:48,306 INFO L175 Difference]: Start difference. First operand has 199 places, 199 transitions, 470 flow. Second operand 3 states and 559 transitions. [2024-10-11 17:10:48,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 214 transitions, 578 flow [2024-10-11 17:10:48,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 214 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:48,312 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 466 flow [2024-10-11 17:10:48,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2024-10-11 17:10:48,314 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, 0 predicate places. [2024-10-11 17:10:48,315 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 466 flow [2024-10-11 17:10:48,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 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-11 17:10:48,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:48,316 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:48,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:10:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:48,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:10:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1553928889, now seen corresponding path program 1 times [2024-10-11 17:10:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667748569] [2024-10-11 17:10:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:48,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:48,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:48,553 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-11 17:10:48,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-11 17:10:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:10:48,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 17:10:48,555 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:48,555 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:10:48,576 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:10:48,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 248 transitions, 523 flow [2024-10-11 17:10:48,638 INFO L124 PetriNetUnfolderBase]: 68/679 cut-off events. [2024-10-11 17:10:48,638 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:10:48,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 679 events. 68/679 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2933 event pairs, 1 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 472. Up to 16 conditions per place. [2024-10-11 17:10:48,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 248 transitions, 523 flow [2024-10-11 17:10:48,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 248 transitions, 523 flow [2024-10-11 17:10:48,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:48,645 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;@1efe9221, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:48,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-11 17:10:48,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:48,649 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-10-11 17:10:48,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:48,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:48,649 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:48,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:10:48,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash 207561008, now seen corresponding path program 1 times [2024-10-11 17:10:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120840431] [2024-10-11 17:10:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:48,849 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-11 17:10:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120840431] [2024-10-11 17:10:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120840431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505147341] [2024-10-11 17:10:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:48,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:48,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 248 [2024-10-11 17:10:48,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 248 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 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-11 17:10:48,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:48,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 248 [2024-10-11 17:10:48,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:51,323 INFO L124 PetriNetUnfolderBase]: 8120/27225 cut-off events. [2024-10-11 17:10:51,323 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-10-11 17:10:51,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38960 conditions, 27225 events. 8120/27225 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 329474 event pairs, 710 based on Foata normal form. 6819/32244 useless extension candidates. Maximal degree in co-relation 6310. Up to 8631 conditions per place. [2024-10-11 17:10:51,476 INFO L140 encePairwiseOnDemand]: 221/248 looper letters, 84 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2024-10-11 17:10:51,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 268 transitions, 741 flow [2024-10-11 17:10:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2024-10-11 17:10:51,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8407258064516129 [2024-10-11 17:10:51,481 INFO L175 Difference]: Start difference. First operand has 229 places, 248 transitions, 523 flow. Second operand 6 states and 1251 transitions. [2024-10-11 17:10:51,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 268 transitions, 741 flow [2024-10-11 17:10:51,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 268 transitions, 741 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:51,488 INFO L231 Difference]: Finished difference. Result has 227 places, 220 transitions, 477 flow [2024-10-11 17:10:51,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=227, PETRI_TRANSITIONS=220} [2024-10-11 17:10:51,490 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -2 predicate places. [2024-10-11 17:10:51,491 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 220 transitions, 477 flow [2024-10-11 17:10:51,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 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-11 17:10:51,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:51,492 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:10:51,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:10:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 817734999, now seen corresponding path program 1 times [2024-10-11 17:10:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988653235] [2024-10-11 17:10:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:51,526 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-11 17:10:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988653235] [2024-10-11 17:10:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988653235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566179170] [2024-10-11 17:10:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:51,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:51,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 248 [2024-10-11 17:10:51,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 220 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-11 17:10:51,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:51,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 248 [2024-10-11 17:10:51,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:59,051 INFO L124 PetriNetUnfolderBase]: 27273/82674 cut-off events. [2024-10-11 17:10:59,051 INFO L125 PetriNetUnfolderBase]: For 2701/5221 co-relation queries the response was YES. [2024-10-11 17:10:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122337 conditions, 82674 events. 27273/82674 cut-off events. For 2701/5221 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 1099328 event pairs, 10995 based on Foata normal form. 29/74834 useless extension candidates. Maximal degree in co-relation 103722. Up to 25188 conditions per place. [2024-10-11 17:10:59,502 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 60 selfloop transitions, 10 changer transitions 0/249 dead transitions. [2024-10-11 17:10:59,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 249 transitions, 696 flow [2024-10-11 17:10:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2024-10-11 17:10:59,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8387096774193549 [2024-10-11 17:10:59,504 INFO L175 Difference]: Start difference. First operand has 227 places, 220 transitions, 477 flow. Second operand 3 states and 624 transitions. [2024-10-11 17:10:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 249 transitions, 696 flow [2024-10-11 17:10:59,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 249 transitions, 686 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:59,509 INFO L231 Difference]: Finished difference. Result has 224 places, 226 transitions, 541 flow [2024-10-11 17:10:59,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=224, PETRI_TRANSITIONS=226} [2024-10-11 17:10:59,510 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -5 predicate places. [2024-10-11 17:10:59,510 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 226 transitions, 541 flow [2024-10-11 17:10:59,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-11 17:10:59,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:59,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:10:59,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:10:59,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -673769591, now seen corresponding path program 1 times [2024-10-11 17:10:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934704629] [2024-10-11 17:10:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:59,535 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-11 17:10:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934704629] [2024-10-11 17:10:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934704629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:59,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508334018] [2024-10-11 17:10:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:59,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 248 [2024-10-11 17:10:59,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 226 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-11 17:10:59,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:59,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 248 [2024-10-11 17:10:59,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:06,106 INFO L124 PetriNetUnfolderBase]: 16710/68710 cut-off events. [2024-10-11 17:11:06,107 INFO L125 PetriNetUnfolderBase]: For 4175/5435 co-relation queries the response was YES. [2024-10-11 17:11:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98148 conditions, 68710 events. 16710/68710 cut-off events. For 4175/5435 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 986893 event pairs, 11681 based on Foata normal form. 1/62406 useless extension candidates. Maximal degree in co-relation 64880. Up to 20086 conditions per place. [2024-10-11 17:11:06,473 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 33 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-10-11 17:11:06,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 231 transitions, 621 flow [2024-10-11 17:11:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-10-11 17:11:06,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8306451612903226 [2024-10-11 17:11:06,475 INFO L175 Difference]: Start difference. First operand has 224 places, 226 transitions, 541 flow. Second operand 3 states and 618 transitions. [2024-10-11 17:11:06,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 231 transitions, 621 flow [2024-10-11 17:11:06,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 231 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:06,496 INFO L231 Difference]: Finished difference. Result has 225 places, 227 transitions, 533 flow [2024-10-11 17:11:06,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=225, PETRI_TRANSITIONS=227} [2024-10-11 17:11:06,496 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -4 predicate places. [2024-10-11 17:11:06,496 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 227 transitions, 533 flow [2024-10-11 17:11:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-11 17:11:06,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:06,497 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] [2024-10-11 17:11:06,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:11:06,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:11:06,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1983260380, now seen corresponding path program 1 times [2024-10-11 17:11:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140595720] [2024-10-11 17:11:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140595720] [2024-10-11 17:11:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140595720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106737077] [2024-10-11 17:11:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:06,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:06,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:06,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:11:06,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:11:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:06,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:11:06,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:11:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:11:06,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:11:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106737077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:11:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 17:11:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590123160] [2024-10-11 17:11:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:06,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 248 [2024-10-11 17:11:06,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 227 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 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-11 17:11:06,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:06,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 248 [2024-10-11 17:11:06,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:17,574 INFO L124 PetriNetUnfolderBase]: 28232/111672 cut-off events. [2024-10-11 17:11:17,575 INFO L125 PetriNetUnfolderBase]: For 1400/1400 co-relation queries the response was YES. [2024-10-11 17:11:17,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157872 conditions, 111672 events. 28232/111672 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 2383. Compared 1724594 event pairs, 17335 based on Foata normal form. 247/102326 useless extension candidates. Maximal degree in co-relation 157810. Up to 22843 conditions per place. [2024-10-11 17:11:18,240 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 47 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-10-11 17:11:18,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 246 transitions, 669 flow [2024-10-11 17:11:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2024-10-11 17:11:18,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8494623655913979 [2024-10-11 17:11:18,242 INFO L175 Difference]: Start difference. First operand has 225 places, 227 transitions, 533 flow. Second operand 3 states and 632 transitions. [2024-10-11 17:11:18,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 246 transitions, 669 flow [2024-10-11 17:11:18,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 246 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:18,249 INFO L231 Difference]: Finished difference. Result has 227 places, 228 transitions, 543 flow [2024-10-11 17:11:18,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=227, PETRI_TRANSITIONS=228} [2024-10-11 17:11:18,250 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -2 predicate places. [2024-10-11 17:11:18,250 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 228 transitions, 543 flow [2024-10-11 17:11:18,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 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-11 17:11:18,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:18,250 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] [2024-10-11 17:11:18,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:11:18,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:18,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:11:18,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1189945337, now seen corresponding path program 1 times [2024-10-11 17:11:18,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:18,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654986075] [2024-10-11 17:11:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:11:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654986075] [2024-10-11 17:11:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654986075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303415285] [2024-10-11 17:11:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:18,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:11:18,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:11:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:18,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:11:18,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:11:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:11:18,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:11:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:11:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303415285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:11:18,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:11:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:11:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846696244] [2024-10-11 17:11:18,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:11:18,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:11:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:11:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:11:18,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 248 [2024-10-11 17:11:18,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 228 transitions, 543 flow. Second operand has 10 states, 10 states have (on average 193.1) internal successors, (1931), 10 states have internal predecessors, (1931), 0 states have call successors, (0), 0 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-11 17:11:18,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:18,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 248 [2024-10-11 17:11:18,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand