./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:19:24,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:19:24,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:19:24,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:19:24,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:19:24,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:19:24,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:19:24,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:19:24,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:19:24,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:19:24,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:19:24,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:19:24,589 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:19:24,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:19:24,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:19:24,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:19:24,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:19:24,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-03-13 22:19:24,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:19:24,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:19:24,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:19:24,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:19:24,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:19:24,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-03-13 22:19:26,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4952587d8/6ad5c43641e4478491ce5c134f189070/FLAG2d8c5a2a7 [2025-03-13 22:19:26,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:19:26,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-03-13 22:19:26,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4952587d8/6ad5c43641e4478491ce5c134f189070/FLAG2d8c5a2a7 [2025-03-13 22:19:26,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4952587d8/6ad5c43641e4478491ce5c134f189070 [2025-03-13 22:19:26,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:19:26,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:19:26,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:19:26,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:19:26,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:19:26,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:19:26" (1/1) ... [2025-03-13 22:19:26,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668f7c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:26, skipping insertion in model container [2025-03-13 22:19:26,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:19:26" (1/1) ... [2025-03-13 22:19:26,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:19:26,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:19:26,944 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:19:26,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:19:27,015 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:19:27,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27 WrapperNode [2025-03-13 22:19:27,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:19:27,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:19:27,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:19:27,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:19:27,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,051 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2025-03-13 22:19:27,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:19:27,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:19:27,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:19:27,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:19:27,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:19:27,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:19:27,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:19:27,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:19:27,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:19:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:19:27,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:19:27,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:19:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:19:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:19:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:19:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:19:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:19:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:19:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:19:27,138 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:19:27,242 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:19:27,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:19:27,461 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:19:27,462 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 22:19:27,505 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:19:27,506 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:19:27,506 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:19:27,536 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:19:27,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:19:27 BoogieIcfgContainer [2025-03-13 22:19:27,537 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:19:27,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:19:27,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:19:27,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:19:27,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:19:26" (1/3) ... [2025-03-13 22:19:27,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d06fd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:19:27, skipping insertion in model container [2025-03-13 22:19:27,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27" (2/3) ... [2025-03-13 22:19:27,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d06fd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:19:27, skipping insertion in model container [2025-03-13 22:19:27,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:19:27" (3/3) ... [2025-03-13 22:19:27,545 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-03-13 22:19:27,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:19:27,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 183 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-13 22:19:27,558 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:19:27,622 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:19:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 395 flow [2025-03-13 22:19:27,725 INFO L124 PetriNetUnfolderBase]: 15/251 cut-off events. [2025-03-13 22:19:27,727 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:19:27,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 251 events. 15/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 628 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 139. Up to 4 conditions per place. [2025-03-13 22:19:27,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 395 flow [2025-03-13 22:19:27,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 194 transitions, 395 flow [2025-03-13 22:19:27,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:27,754 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;@6a6b6d3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:27,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:19:27,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:27,770 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-03-13 22:19:27,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:27,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:27,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:27,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:27,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1708185961, now seen corresponding path program 1 times [2025-03-13 22:19:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157992559] [2025-03-13 22:19:27,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:27,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:27,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 22:19:27,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 22:19:27,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:27,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:28,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157992559] [2025-03-13 22:19:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157992559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293606992] [2025-03-13 22:19:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:28,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:28,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:28,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2025-03-13 22:19:28,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 194 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2025-03-13 22:19:28,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:28,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2025-03-13 22:19:28,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:28,327 INFO L124 PetriNetUnfolderBase]: 48/549 cut-off events. [2025-03-13 22:19:28,327 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:19:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 549 events. 48/549 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2307 event pairs, 28 based on Foata normal form. 48/546 useless extension candidates. Maximal degree in co-relation 542. Up to 108 conditions per place. [2025-03-13 22:19:28,331 INFO L140 encePairwiseOnDemand]: 181/194 looper letters, 22 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-03-13 22:19:28,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 188 transitions, 431 flow [2025-03-13 22:19:28,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2025-03-13 22:19:28,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9209621993127147 [2025-03-13 22:19:28,342 INFO L175 Difference]: Start difference. First operand has 186 places, 194 transitions, 395 flow. Second operand 3 states and 536 transitions. [2025-03-13 22:19:28,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 188 transitions, 431 flow [2025-03-13 22:19:28,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 188 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:28,350 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 379 flow [2025-03-13 22:19:28,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2025-03-13 22:19:28,354 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 1 predicate places. [2025-03-13 22:19:28,355 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 379 flow [2025-03-13 22:19:28,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2025-03-13 22:19:28,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:28,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:19:28,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:28,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1967327323, now seen corresponding path program 1 times [2025-03-13 22:19:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:28,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642501137] [2025-03-13 22:19:28,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:28,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:19:28,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:19:28,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:28,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:28,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642501137] [2025-03-13 22:19:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642501137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565462502] [2025-03-13 22:19:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:28,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:28,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:29,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 194 [2025-03-13 22:19:29,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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) [2025-03-13 22:19:29,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:29,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 194 [2025-03-13 22:19:29,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:29,299 INFO L124 PetriNetUnfolderBase]: 108/686 cut-off events. [2025-03-13 22:19:29,300 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:19:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 686 events. 108/686 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3568 event pairs, 55 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 828. Up to 181 conditions per place. [2025-03-13 22:19:29,306 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 48 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2025-03-13 22:19:29,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 205 transitions, 531 flow [2025-03-13 22:19:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 972 transitions. [2025-03-13 22:19:29,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8350515463917526 [2025-03-13 22:19:29,309 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 379 flow. Second operand 6 states and 972 transitions. [2025-03-13 22:19:29,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 205 transitions, 531 flow [2025-03-13 22:19:29,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 205 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:29,313 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 383 flow [2025-03-13 22:19:29,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2025-03-13 22:19:29,314 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 3 predicate places. [2025-03-13 22:19:29,314 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 383 flow [2025-03-13 22:19:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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) [2025-03-13 22:19:29,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:29,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:29,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:19:29,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:29,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2003557676, now seen corresponding path program 1 times [2025-03-13 22:19:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103932254] [2025-03-13 22:19:29,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:29,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:19:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:19:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103932254] [2025-03-13 22:19:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103932254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117878137] [2025-03-13 22:19:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:29,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:29,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:29,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2025-03-13 22:19:29,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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) [2025-03-13 22:19:29,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:29,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2025-03-13 22:19:29,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:29,563 INFO L124 PetriNetUnfolderBase]: 91/842 cut-off events. [2025-03-13 22:19:29,563 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:19:29,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 842 events. 91/842 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4683 event pairs, 30 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 959. Up to 125 conditions per place. [2025-03-13 22:19:29,571 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 30 selfloop transitions, 6 changer transitions 0/194 dead transitions. [2025-03-13 22:19:29,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 194 transitions, 484 flow [2025-03-13 22:19:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-13 22:19:29,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2025-03-13 22:19:29,575 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 383 flow. Second operand 3 states and 519 transitions. [2025-03-13 22:19:29,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 194 transitions, 484 flow [2025-03-13 22:19:29,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 194 transitions, 474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:19:29,582 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 411 flow [2025-03-13 22:19:29,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-03-13 22:19:29,585 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 0 predicate places. [2025-03-13 22:19:29,585 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 411 flow [2025-03-13 22:19:29,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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) [2025-03-13 22:19:29,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:29,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:29,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:19:29,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:29,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash 979886741, now seen corresponding path program 1 times [2025-03-13 22:19:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:29,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251696445] [2025-03-13 22:19:29,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:29,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:19:29,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:19:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251696445] [2025-03-13 22:19:29,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251696445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:29,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:29,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91345769] [2025-03-13 22:19:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:29,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:29,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:29,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:29,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2025-03-13 22:19:29,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2025-03-13 22:19:29,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:29,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2025-03-13 22:19:29,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:29,786 INFO L124 PetriNetUnfolderBase]: 94/841 cut-off events. [2025-03-13 22:19:29,787 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-13 22:19:29,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 841 events. 94/841 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4731 event pairs, 60 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1056. Up to 189 conditions per place. [2025-03-13 22:19:29,791 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 27 selfloop transitions, 4 changer transitions 0/190 dead transitions. [2025-03-13 22:19:29,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 491 flow [2025-03-13 22:19:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2025-03-13 22:19:29,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848797250859106 [2025-03-13 22:19:29,793 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 411 flow. Second operand 3 states and 515 transitions. [2025-03-13 22:19:29,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 491 flow [2025-03-13 22:19:29,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:29,797 INFO L231 Difference]: Finished difference. Result has 188 places, 186 transitions, 431 flow [2025-03-13 22:19:29,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=188, PETRI_TRANSITIONS=186} [2025-03-13 22:19:29,798 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 2 predicate places. [2025-03-13 22:19:29,798 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 431 flow [2025-03-13 22:19:29,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2025-03-13 22:19:29,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:29,799 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:29,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:19:29,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:29,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1106182888, now seen corresponding path program 1 times [2025-03-13 22:19:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:29,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393093640] [2025-03-13 22:19:29,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:29,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:19:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:19:29,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:29,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:29,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:19:29,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:19:29,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:19:29,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:29,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:29,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:19:29,873 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:19:29,874 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:19:29,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:19:29,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:19:29,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:19:29,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:19:29,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:19:29,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:19:29,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:19:29,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:19:29,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:19:29,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:19:29,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:19:29,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:19:29,877 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:19:29,879 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:19:29,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:19:29,908 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:19:29,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 242 transitions, 500 flow [2025-03-13 22:19:29,948 INFO L124 PetriNetUnfolderBase]: 27/383 cut-off events. [2025-03-13 22:19:29,949 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:19:29,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 383 events. 27/383 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1175 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 253. Up to 6 conditions per place. [2025-03-13 22:19:29,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 242 transitions, 500 flow [2025-03-13 22:19:29,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 242 transitions, 500 flow [2025-03-13 22:19:29,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:29,957 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;@6a6b6d3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:29,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:19:29,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:29,965 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-03-13 22:19:29,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:29,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:29,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:29,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -964867415, now seen corresponding path program 1 times [2025-03-13 22:19:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779067056] [2025-03-13 22:19:29,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:29,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 22:19:29,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 22:19:29,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:29,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779067056] [2025-03-13 22:19:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779067056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:30,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174159989] [2025-03-13 22:19:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:30,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:30,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:30,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 242 [2025-03-13 22:19:30,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 242 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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) [2025-03-13 22:19:30,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:30,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 242 [2025-03-13 22:19:30,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:30,546 INFO L124 PetriNetUnfolderBase]: 788/4289 cut-off events. [2025-03-13 22:19:30,546 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-13 22:19:30,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5642 conditions, 4289 events. 788/4289 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 40322 event pairs, 348 based on Foata normal form. 555/4458 useless extension candidates. Maximal degree in co-relation 710. Up to 1303 conditions per place. [2025-03-13 22:19:30,570 INFO L140 encePairwiseOnDemand]: 223/242 looper letters, 31 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2025-03-13 22:19:30,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 231 transitions, 544 flow [2025-03-13 22:19:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2025-03-13 22:19:30,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994490358126722 [2025-03-13 22:19:30,575 INFO L175 Difference]: Start difference. First operand has 229 places, 242 transitions, 500 flow. Second operand 3 states and 653 transitions. [2025-03-13 22:19:30,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 231 transitions, 544 flow [2025-03-13 22:19:30,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 231 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:30,579 INFO L231 Difference]: Finished difference. Result has 230 places, 225 transitions, 476 flow [2025-03-13 22:19:30,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=230, PETRI_TRANSITIONS=225} [2025-03-13 22:19:30,581 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 1 predicate places. [2025-03-13 22:19:30,581 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 225 transitions, 476 flow [2025-03-13 22:19:30,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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) [2025-03-13 22:19:30,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:30,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:30,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:19:30,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1553483739, now seen corresponding path program 1 times [2025-03-13 22:19:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929403170] [2025-03-13 22:19:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:30,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:19:30,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:19:30,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:30,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929403170] [2025-03-13 22:19:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929403170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:30,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136558154] [2025-03-13 22:19:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:30,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:31,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 242 [2025-03-13 22:19:31,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 225 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 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) [2025-03-13 22:19:31,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:31,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 242 [2025-03-13 22:19:31,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:31,742 INFO L124 PetriNetUnfolderBase]: 1718/6052 cut-off events. [2025-03-13 22:19:31,742 INFO L125 PetriNetUnfolderBase]: For 128/130 co-relation queries the response was YES. [2025-03-13 22:19:31,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9032 conditions, 6052 events. 1718/6052 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 57364 event pairs, 665 based on Foata normal form. 0/5597 useless extension candidates. Maximal degree in co-relation 6431. Up to 2015 conditions per place. [2025-03-13 22:19:31,775 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 80 selfloop transitions, 6 changer transitions 0/272 dead transitions. [2025-03-13 22:19:31,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 272 transitions, 742 flow [2025-03-13 22:19:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1208 transitions. [2025-03-13 22:19:31,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319559228650137 [2025-03-13 22:19:31,778 INFO L175 Difference]: Start difference. First operand has 230 places, 225 transitions, 476 flow. Second operand 6 states and 1208 transitions. [2025-03-13 22:19:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 272 transitions, 742 flow [2025-03-13 22:19:31,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 272 transitions, 740 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:19:31,781 INFO L231 Difference]: Finished difference. Result has 233 places, 224 transitions, 484 flow [2025-03-13 22:19:31,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=484, PETRI_PLACES=233, PETRI_TRANSITIONS=224} [2025-03-13 22:19:31,782 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 4 predicate places. [2025-03-13 22:19:31,782 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 224 transitions, 484 flow [2025-03-13 22:19:31,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 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) [2025-03-13 22:19:31,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:31,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:31,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:19:31,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:31,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash -836695194, now seen corresponding path program 1 times [2025-03-13 22:19:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480404942] [2025-03-13 22:19:31,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:31,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:19:31,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:19:31,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480404942] [2025-03-13 22:19:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480404942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91136500] [2025-03-13 22:19:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:31,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:31,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:31,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:31,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 242 [2025-03-13 22:19:31,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 224 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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) [2025-03-13 22:19:31,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:31,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 242 [2025-03-13 22:19:31,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:33,249 INFO L124 PetriNetUnfolderBase]: 3895/14500 cut-off events. [2025-03-13 22:19:33,249 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-13 22:19:33,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21058 conditions, 14500 events. 3895/14500 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 161489 event pairs, 1409 based on Foata normal form. 0/13005 useless extension candidates. Maximal degree in co-relation 14553. Up to 3516 conditions per place. [2025-03-13 22:19:33,396 INFO L140 encePairwiseOnDemand]: 223/242 looper letters, 58 selfloop transitions, 14 changer transitions 0/257 dead transitions. [2025-03-13 22:19:33,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 257 transitions, 705 flow [2025-03-13 22:19:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-03-13 22:19:33,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2025-03-13 22:19:33,398 INFO L175 Difference]: Start difference. First operand has 233 places, 224 transitions, 484 flow. Second operand 3 states and 635 transitions. [2025-03-13 22:19:33,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 257 transitions, 705 flow [2025-03-13 22:19:33,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 257 transitions, 693 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:19:33,402 INFO L231 Difference]: Finished difference. Result has 232 places, 238 transitions, 594 flow [2025-03-13 22:19:33,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=232, PETRI_TRANSITIONS=238} [2025-03-13 22:19:33,403 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 3 predicate places. [2025-03-13 22:19:33,403 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 238 transitions, 594 flow [2025-03-13 22:19:33,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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) [2025-03-13 22:19:33,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:33,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:19:33,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2006149557, now seen corresponding path program 1 times [2025-03-13 22:19:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002783537] [2025-03-13 22:19:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:33,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:19:33,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:19:33,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:33,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002783537] [2025-03-13 22:19:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002783537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736319334] [2025-03-13 22:19:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:33,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:33,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-13 22:19:33,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 238 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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) [2025-03-13 22:19:33,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:33,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-13 22:19:33,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:35,014 INFO L124 PetriNetUnfolderBase]: 4031/16240 cut-off events. [2025-03-13 22:19:35,014 INFO L125 PetriNetUnfolderBase]: For 4263/4421 co-relation queries the response was YES. [2025-03-13 22:19:35,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26974 conditions, 16240 events. 4031/16240 cut-off events. For 4263/4421 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 189840 event pairs, 2487 based on Foata normal form. 51/14780 useless extension candidates. Maximal degree in co-relation 25650. Up to 5521 conditions per place. [2025-03-13 22:19:35,126 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 52 selfloop transitions, 14 changer transitions 0/262 dead transitions. [2025-03-13 22:19:35,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 262 transitions, 812 flow [2025-03-13 22:19:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2025-03-13 22:19:35,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8663911845730028 [2025-03-13 22:19:35,128 INFO L175 Difference]: Start difference. First operand has 232 places, 238 transitions, 594 flow. Second operand 3 states and 629 transitions. [2025-03-13 22:19:35,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 262 transitions, 812 flow [2025-03-13 22:19:35,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 262 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:35,141 INFO L231 Difference]: Finished difference. Result has 234 places, 250 transitions, 692 flow [2025-03-13 22:19:35,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=234, PETRI_TRANSITIONS=250} [2025-03-13 22:19:35,142 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 5 predicate places. [2025-03-13 22:19:35,143 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 250 transitions, 692 flow [2025-03-13 22:19:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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) [2025-03-13 22:19:35,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:35,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:19:35,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2120108823, now seen corresponding path program 1 times [2025-03-13 22:19:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771040809] [2025-03-13 22:19:35,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:35,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:19:35,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:19:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:19:35,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771040809] [2025-03-13 22:19:35,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771040809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:35,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:35,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685094160] [2025-03-13 22:19:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:35,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:19:35,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:35,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:19:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:19:35,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 242 [2025-03-13 22:19:35,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 250 transitions, 692 flow. Second operand has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 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) [2025-03-13 22:19:35,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:35,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 242 [2025-03-13 22:19:35,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:36,750 INFO L124 PetriNetUnfolderBase]: 3145/18079 cut-off events. [2025-03-13 22:19:36,751 INFO L125 PetriNetUnfolderBase]: For 1529/1952 co-relation queries the response was YES. [2025-03-13 22:19:36,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25815 conditions, 18079 events. 3145/18079 cut-off events. For 1529/1952 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 235665 event pairs, 1192 based on Foata normal form. 20/16126 useless extension candidates. Maximal degree in co-relation 11650. Up to 3831 conditions per place. [2025-03-13 22:19:36,838 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 56 selfloop transitions, 5 changer transitions 0/282 dead transitions. [2025-03-13 22:19:36,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 282 transitions, 878 flow [2025-03-13 22:19:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2025-03-13 22:19:36,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567493112947658 [2025-03-13 22:19:36,841 INFO L175 Difference]: Start difference. First operand has 234 places, 250 transitions, 692 flow. Second operand 6 states and 1244 transitions. [2025-03-13 22:19:36,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 282 transitions, 878 flow [2025-03-13 22:19:36,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 282 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:36,848 INFO L231 Difference]: Finished difference. Result has 240 places, 252 transitions, 690 flow [2025-03-13 22:19:36,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=240, PETRI_TRANSITIONS=252} [2025-03-13 22:19:36,849 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 11 predicate places. [2025-03-13 22:19:36,849 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 252 transitions, 690 flow [2025-03-13 22:19:36,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 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) [2025-03-13 22:19:36,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:36,850 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:36,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:19:36,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 403400571, now seen corresponding path program 1 times [2025-03-13 22:19:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:36,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312871110] [2025-03-13 22:19:36,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:36,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-13 22:19:36,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-13 22:19:36,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:36,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:19:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312871110] [2025-03-13 22:19:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312871110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:36,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955869748] [2025-03-13 22:19:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:36,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:36,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:36,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-13 22:19:36,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 252 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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) [2025-03-13 22:19:36,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:36,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-13 22:19:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:38,789 INFO L124 PetriNetUnfolderBase]: 4654/19894 cut-off events. [2025-03-13 22:19:38,789 INFO L125 PetriNetUnfolderBase]: For 5138/5327 co-relation queries the response was YES. [2025-03-13 22:19:38,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32413 conditions, 19894 events. 4654/19894 cut-off events. For 5138/5327 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 246860 event pairs, 2715 based on Foata normal form. 35/17883 useless extension candidates. Maximal degree in co-relation 32173. Up to 6268 conditions per place. [2025-03-13 22:19:38,902 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 59 selfloop transitions, 17 changer transitions 0/276 dead transitions. [2025-03-13 22:19:38,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 276 transitions, 925 flow [2025-03-13 22:19:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2025-03-13 22:19:38,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650137741046832 [2025-03-13 22:19:38,904 INFO L175 Difference]: Start difference. First operand has 240 places, 252 transitions, 690 flow. Second operand 3 states and 628 transitions. [2025-03-13 22:19:38,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 276 transitions, 925 flow [2025-03-13 22:19:38,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 276 transitions, 919 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:38,909 INFO L231 Difference]: Finished difference. Result has 242 places, 265 transitions, 838 flow [2025-03-13 22:19:38,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=242, PETRI_TRANSITIONS=265} [2025-03-13 22:19:38,910 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 13 predicate places. [2025-03-13 22:19:38,911 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 265 transitions, 838 flow [2025-03-13 22:19:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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) [2025-03-13 22:19:38,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:38,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:38,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:19:38,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:38,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1632595839, now seen corresponding path program 1 times [2025-03-13 22:19:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759887657] [2025-03-13 22:19:38,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:38,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-13 22:19:38,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-13 22:19:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:19:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759887657] [2025-03-13 22:19:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759887657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050345615] [2025-03-13 22:19:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:38,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:38,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-13 22:19:38,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 265 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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) [2025-03-13 22:19:38,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:38,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-13 22:19:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:40,920 INFO L124 PetriNetUnfolderBase]: 5220/22411 cut-off events. [2025-03-13 22:19:40,920 INFO L125 PetriNetUnfolderBase]: For 12878/13300 co-relation queries the response was YES. [2025-03-13 22:19:40,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39597 conditions, 22411 events. 5220/22411 cut-off events. For 12878/13300 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 283875 event pairs, 2889 based on Foata normal form. 60/20190 useless extension candidates. Maximal degree in co-relation 39336. Up to 7039 conditions per place. [2025-03-13 22:19:41,050 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 71 selfloop transitions, 17 changer transitions 0/290 dead transitions. [2025-03-13 22:19:41,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 290 transitions, 1132 flow [2025-03-13 22:19:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2025-03-13 22:19:41,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8663911845730028 [2025-03-13 22:19:41,052 INFO L175 Difference]: Start difference. First operand has 242 places, 265 transitions, 838 flow. Second operand 3 states and 629 transitions. [2025-03-13 22:19:41,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 290 transitions, 1132 flow [2025-03-13 22:19:41,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 290 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:41,070 INFO L231 Difference]: Finished difference. Result has 244 places, 278 transitions, 980 flow [2025-03-13 22:19:41,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=244, PETRI_TRANSITIONS=278} [2025-03-13 22:19:41,071 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 15 predicate places. [2025-03-13 22:19:41,071 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 278 transitions, 980 flow [2025-03-13 22:19:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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) [2025-03-13 22:19:41,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:41,071 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:41,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:19:41,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 638454892, now seen corresponding path program 1 times [2025-03-13 22:19:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490958952] [2025-03-13 22:19:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:41,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 22:19:41,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 22:19:41,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:41,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:41,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:19:41,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 22:19:41,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 22:19:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:41,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:41,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:19:41,123 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 22:19:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:19:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:19:41,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:19:41,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:41,126 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:19:41,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:19:41,145 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:19:41,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 290 transitions, 607 flow [2025-03-13 22:19:41,187 INFO L124 PetriNetUnfolderBase]: 42/558 cut-off events. [2025-03-13 22:19:41,187 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:19:41,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 558 events. 42/558 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1970 event pairs, 1 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 391. Up to 12 conditions per place. [2025-03-13 22:19:41,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 290 transitions, 607 flow [2025-03-13 22:19:41,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 290 transitions, 607 flow [2025-03-13 22:19:41,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:41,195 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;@6a6b6d3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:41,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-13 22:19:41,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:41,199 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-03-13 22:19:41,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:41,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:41,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:41,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:19:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1754412567, now seen corresponding path program 1 times [2025-03-13 22:19:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585646414] [2025-03-13 22:19:41,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:41,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 22:19:41,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 22:19:41,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:41,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585646414] [2025-03-13 22:19:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585646414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:41,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:41,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169796061] [2025-03-13 22:19:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:41,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:41,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:41,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 290 [2025-03-13 22:19:41,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 290 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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) [2025-03-13 22:19:41,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:41,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 290 [2025-03-13 22:19:41,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:44,868 INFO L124 PetriNetUnfolderBase]: 8948/34702 cut-off events. [2025-03-13 22:19:44,868 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-03-13 22:19:44,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47940 conditions, 34702 events. 8948/34702 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 447887 event pairs, 5659 based on Foata normal form. 5599/37069 useless extension candidates. Maximal degree in co-relation 6157. Up to 12802 conditions per place. [2025-03-13 22:19:45,040 INFO L140 encePairwiseOnDemand]: 265/290 looper letters, 39 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-03-13 22:19:45,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 273 transitions, 655 flow [2025-03-13 22:19:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2025-03-13 22:19:45,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8839080459770114 [2025-03-13 22:19:45,041 INFO L175 Difference]: Start difference. First operand has 272 places, 290 transitions, 607 flow. Second operand 3 states and 769 transitions. [2025-03-13 22:19:45,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 273 transitions, 655 flow [2025-03-13 22:19:45,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 273 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:45,044 INFO L231 Difference]: Finished difference. Result has 273 places, 267 transitions, 571 flow [2025-03-13 22:19:45,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=273, PETRI_TRANSITIONS=267} [2025-03-13 22:19:45,045 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 1 predicate places. [2025-03-13 22:19:45,045 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 267 transitions, 571 flow [2025-03-13 22:19:45,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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) [2025-03-13 22:19:45,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:45,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:19:45,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:19:45,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1285153957, now seen corresponding path program 1 times [2025-03-13 22:19:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327591267] [2025-03-13 22:19:45,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:45,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:19:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:19:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:45,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327591267] [2025-03-13 22:19:45,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327591267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:45,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:45,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:45,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835465255] [2025-03-13 22:19:45,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:45,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:45,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:45,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:45,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 290 [2025-03-13 22:19:45,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 267 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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) [2025-03-13 22:19:45,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:45,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 290 [2025-03-13 22:19:45,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:50,480 INFO L124 PetriNetUnfolderBase]: 19555/50847 cut-off events. [2025-03-13 22:19:50,480 INFO L125 PetriNetUnfolderBase]: For 1359/1359 co-relation queries the response was YES. [2025-03-13 22:19:50,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80007 conditions, 50847 events. 19555/50847 cut-off events. For 1359/1359 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 613706 event pairs, 2086 based on Foata normal form. 0/47385 useless extension candidates. Maximal degree in co-relation 75230. Up to 20048 conditions per place. [2025-03-13 22:19:50,794 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 112 selfloop transitions, 6 changer transitions 0/338 dead transitions. [2025-03-13 22:19:50,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 338 transitions, 949 flow [2025-03-13 22:19:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1444 transitions. [2025-03-13 22:19:50,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8298850574712644 [2025-03-13 22:19:50,797 INFO L175 Difference]: Start difference. First operand has 273 places, 267 transitions, 571 flow. Second operand 6 states and 1444 transitions. [2025-03-13 22:19:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 338 transitions, 949 flow [2025-03-13 22:19:50,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 338 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:19:50,802 INFO L231 Difference]: Finished difference. Result has 276 places, 266 transitions, 579 flow [2025-03-13 22:19:50,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=579, PETRI_PLACES=276, PETRI_TRANSITIONS=266} [2025-03-13 22:19:50,804 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 4 predicate places. [2025-03-13 22:19:50,804 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 266 transitions, 579 flow [2025-03-13 22:19:50,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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) [2025-03-13 22:19:50,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:50,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:50,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:19:50,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:19:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2052091348, now seen corresponding path program 1 times [2025-03-13 22:19:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083463089] [2025-03-13 22:19:50,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:50,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:19:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:19:50,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083463089] [2025-03-13 22:19:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083463089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168583061] [2025-03-13 22:19:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:50,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:50,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:50,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:50,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 290 [2025-03-13 22:19:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 266 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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) [2025-03-13 22:19:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:50,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 290 [2025-03-13 22:19:50,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand