./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:33:50,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:33:50,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:33:50,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:33:50,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:33:50,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:33:50,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:33:50,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:33:50,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:33:50,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:33:50,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:33:50,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:33:50,556 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:33:50,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:33:50,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:33:50,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:33:50,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:33:50,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:33:50,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:33:50,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:33:50,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:50,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:33:50,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:33:50,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:33:50,560 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-jdk21/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 -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2025-02-08 05:33:50,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:33:50,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:33:50,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:33:50,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:33:50,809 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:33:50,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-02-08 05:33:51,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cd995145/d45428e4e3f242fb98b5a7a957ac906d/FLAG9f86f2be5 [2025-02-08 05:33:52,340 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:33:52,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-02-08 05:33:52,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cd995145/d45428e4e3f242fb98b5a7a957ac906d/FLAG9f86f2be5 [2025-02-08 05:33:52,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cd995145/d45428e4e3f242fb98b5a7a957ac906d [2025-02-08 05:33:52,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:33:52,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:33:52,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:52,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:33:52,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:33:52,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:52" (1/1) ... [2025-02-08 05:33:52,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:52, skipping insertion in model container [2025-02-08 05:33:52,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:52" (1/1) ... [2025-02-08 05:33:52,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:33:52,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:52,959 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:33:53,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:53,067 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:33:53,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53 WrapperNode [2025-02-08 05:33:53,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:53,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:53,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:33:53,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:33:53,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,108 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 150 [2025-02-08 05:33:53,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:53,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:33:53,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:33:53,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:33:53,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:33:53,138 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:33:53,138 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:33:53,139 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:33:53,139 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (1/1) ... [2025-02-08 05:33:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:53,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:53,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:33:53,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:33:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:33:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:33:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:33:53,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:33:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:33:53,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:33:53,188 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:33:53,288 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:33:53,290 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:33:53,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:33:53,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:33:53,510 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:33:53,511 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:33:53,538 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:33:53,539 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:33:53,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:53 BoogieIcfgContainer [2025-02-08 05:33:53,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:33:53,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:33:53,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:33:53,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:33:53,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:33:52" (1/3) ... [2025-02-08 05:33:53,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5e870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:53, skipping insertion in model container [2025-02-08 05:33:53,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:53" (2/3) ... [2025-02-08 05:33:53,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5e870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:53, skipping insertion in model container [2025-02-08 05:33:53,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:53" (3/3) ... [2025-02-08 05:33:53,547 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2025-02-08 05:33:53,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:33:53,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_07-cond_racing2.i that has 2 procedures, 198 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-02-08 05:33:53,559 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:33:53,601 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:33:53,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 212 transitions, 431 flow [2025-02-08 05:33:53,706 INFO L124 PetriNetUnfolderBase]: 21/280 cut-off events. [2025-02-08 05:33:53,708 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:33:53,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 280 events. 21/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 708 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 154. Up to 6 conditions per place. [2025-02-08 05:33:53,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 212 transitions, 431 flow [2025-02-08 05:33:53,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 212 transitions, 431 flow [2025-02-08 05:33:53,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:53,742 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;@5b2173f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:53,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:33:53,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:53,763 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2025-02-08 05:33:53,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:53,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:53,764 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] [2025-02-08 05:33:53,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:53,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash -477797633, now seen corresponding path program 1 times [2025-02-08 05:33:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:53,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18975316] [2025-02-08 05:33:53,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:53,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:33:53,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:33:53,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:53,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18975316] [2025-02-08 05:33:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18975316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542202469] [2025-02-08 05:33:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:54,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:54,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 212 [2025-02-08 05:33:54,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 212 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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-02-08 05:33:54,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:54,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 212 [2025-02-08 05:33:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:55,016 INFO L124 PetriNetUnfolderBase]: 135/952 cut-off events. [2025-02-08 05:33:55,017 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-08 05:33:55,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 952 events. 135/952 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5595 event pairs, 60 based on Foata normal form. 130/976 useless extension candidates. Maximal degree in co-relation 1046. Up to 198 conditions per place. [2025-02-08 05:33:55,024 INFO L140 encePairwiseOnDemand]: 196/212 looper letters, 48 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2025-02-08 05:33:55,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 223 transitions, 559 flow [2025-02-08 05:33:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1114 transitions. [2025-02-08 05:33:55,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8757861635220126 [2025-02-08 05:33:55,045 INFO L175 Difference]: Start difference. First operand has 201 places, 212 transitions, 431 flow. Second operand 6 states and 1114 transitions. [2025-02-08 05:33:55,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 223 transitions, 559 flow [2025-02-08 05:33:55,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 223 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:55,055 INFO L231 Difference]: Finished difference. Result has 203 places, 199 transitions, 415 flow [2025-02-08 05:33:55,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=203, PETRI_TRANSITIONS=199} [2025-02-08 05:33:55,060 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 2 predicate places. [2025-02-08 05:33:55,062 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 199 transitions, 415 flow [2025-02-08 05:33:55,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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-02-08 05:33:55,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,063 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] [2025-02-08 05:33:55,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:33:55,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:55,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 274600123, now seen corresponding path program 1 times [2025-02-08 05:33:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986095727] [2025-02-08 05:33:55,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:33:55,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:33:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:55,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:55,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986095727] [2025-02-08 05:33:55,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986095727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:55,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:55,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:55,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037018256] [2025-02-08 05:33:55,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:55,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:55,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:55,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:55,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 212 [2025-02-08 05:33:55,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 199 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:55,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:55,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 212 [2025-02-08 05:33:55,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:55,295 INFO L124 PetriNetUnfolderBase]: 57/618 cut-off events. [2025-02-08 05:33:55,296 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:33:55,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 618 events. 57/618 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2721 event pairs, 25 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 612. Up to 96 conditions per place. [2025-02-08 05:33:55,301 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 22 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2025-02-08 05:33:55,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 205 transitions, 475 flow [2025-02-08 05:33:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2025-02-08 05:33:55,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9025157232704403 [2025-02-08 05:33:55,303 INFO L175 Difference]: Start difference. First operand has 203 places, 199 transitions, 415 flow. Second operand 3 states and 574 transitions. [2025-02-08 05:33:55,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 205 transitions, 475 flow [2025-02-08 05:33:55,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 205 transitions, 465 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:55,309 INFO L231 Difference]: Finished difference. Result has 201 places, 199 transitions, 413 flow [2025-02-08 05:33:55,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=201, PETRI_TRANSITIONS=199} [2025-02-08 05:33:55,311 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 0 predicate places. [2025-02-08 05:33:55,311 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 413 flow [2025-02-08 05:33:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:55,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,312 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] [2025-02-08 05:33:55,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:33:55,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:55,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash -639394537, now seen corresponding path program 1 times [2025-02-08 05:33:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218398966] [2025-02-08 05:33:55,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:33:55,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:33:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:55,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:55,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218398966] [2025-02-08 05:33:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218398966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:55,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124775749] [2025-02-08 05:33:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:55,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:55,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:55,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 212 [2025-02-08 05:33:55,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 199 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-02-08 05:33:55,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:55,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 212 [2025-02-08 05:33:55,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:55,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][205], [214#true, 201#true, 15#L952-3true, Black: 212#(= |ULTIMATE.start_main_~i~1#1| 0), 210#true]) [2025-02-08 05:33:55,619 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2025-02-08 05:33:55,620 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is not cut-off event [2025-02-08 05:33:55,620 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2025-02-08 05:33:55,620 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2025-02-08 05:33:55,630 INFO L124 PetriNetUnfolderBase]: 134/962 cut-off events. [2025-02-08 05:33:55,630 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:33:55,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 962 events. 134/962 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5595 event pairs, 32 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1116. Up to 130 conditions per place. [2025-02-08 05:33:55,636 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 30 selfloop transitions, 6 changer transitions 0/212 dead transitions. [2025-02-08 05:33:55,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 212 transitions, 514 flow [2025-02-08 05:33:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2025-02-08 05:33:55,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2025-02-08 05:33:55,640 INFO L175 Difference]: Start difference. First operand has 201 places, 199 transitions, 413 flow. Second operand 3 states and 573 transitions. [2025-02-08 05:33:55,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 212 transitions, 514 flow [2025-02-08 05:33:55,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 212 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:55,644 INFO L231 Difference]: Finished difference. Result has 201 places, 201 transitions, 447 flow [2025-02-08 05:33:55,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=201, PETRI_TRANSITIONS=201} [2025-02-08 05:33:55,645 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 0 predicate places. [2025-02-08 05:33:55,645 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 201 transitions, 447 flow [2025-02-08 05:33:55,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-02-08 05:33:55,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,646 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] [2025-02-08 05:33:55,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:33:55,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:55,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash -320069514, now seen corresponding path program 1 times [2025-02-08 05:33:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724377849] [2025-02-08 05:33:55,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:33:55,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:33:55,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:55,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:33:55,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:33:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:33:55,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:55,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:33:55,751 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:33:55,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-08 05:33:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-08 05:33:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-08 05:33:55,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-08 05:33:55,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-08 05:33:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:33:55,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:33:55,756 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:33:55,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:33:55,792 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:33:55,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 263 transitions, 542 flow [2025-02-08 05:33:55,839 INFO L124 PetriNetUnfolderBase]: 36/426 cut-off events. [2025-02-08 05:33:55,839 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:33:55,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 426 events. 36/426 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1354 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2025-02-08 05:33:55,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 263 transitions, 542 flow [2025-02-08 05:33:55,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 263 transitions, 542 flow [2025-02-08 05:33:55,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:55,845 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;@5b2173f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:55,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:33:55,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:55,854 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2025-02-08 05:33:55,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:55,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,854 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] [2025-02-08 05:33:55,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:55,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1386269951, now seen corresponding path program 1 times [2025-02-08 05:33:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251504692] [2025-02-08 05:33:55,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:33:55,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:33:55,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:56,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:56,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251504692] [2025-02-08 05:33:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251504692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041373865] [2025-02-08 05:33:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:56,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:56,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:56,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:56,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 263 [2025-02-08 05:33:56,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 263 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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-02-08 05:33:56,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:56,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 263 [2025-02-08 05:33:56,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:57,662 INFO L124 PetriNetUnfolderBase]: 1710/6421 cut-off events. [2025-02-08 05:33:57,662 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-08 05:33:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9136 conditions, 6421 events. 1710/6421 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 62189 event pairs, 168 based on Foata normal form. 1791/7560 useless extension candidates. Maximal degree in co-relation 1773. Up to 1840 conditions per place. [2025-02-08 05:33:57,697 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 80 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2025-02-08 05:33:57,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 292 transitions, 770 flow [2025-02-08 05:33:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-02-08 05:33:57,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859315589353612 [2025-02-08 05:33:57,704 INFO L175 Difference]: Start difference. First operand has 247 places, 263 transitions, 542 flow. Second operand 6 states and 1398 transitions. [2025-02-08 05:33:57,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 292 transitions, 770 flow [2025-02-08 05:33:57,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 292 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:57,709 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 514 flow [2025-02-08 05:33:57,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-02-08 05:33:57,713 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-02-08 05:33:57,713 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 514 flow [2025-02-08 05:33:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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-02-08 05:33:57,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:57,714 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] [2025-02-08 05:33:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:33:57,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1214881054, now seen corresponding path program 1 times [2025-02-08 05:33:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823707902] [2025-02-08 05:33:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:57,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:33:57,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:33:57,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:57,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823707902] [2025-02-08 05:33:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823707902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327055020] [2025-02-08 05:33:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:57,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:57,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:57,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:57,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 263 [2025-02-08 05:33:57,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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-02-08 05:33:57,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:57,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 263 [2025-02-08 05:33:57,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:58,197 INFO L124 PetriNetUnfolderBase]: 958/5019 cut-off events. [2025-02-08 05:33:58,198 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-02-08 05:33:58,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6603 conditions, 5019 events. 958/5019 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 47970 event pairs, 588 based on Foata normal form. 1/4546 useless extension candidates. Maximal degree in co-relation 4097. Up to 1425 conditions per place. [2025-02-08 05:33:58,228 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 31 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-02-08 05:33:58,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 251 transitions, 596 flow [2025-02-08 05:33:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-02-08 05:33:58,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795944233206591 [2025-02-08 05:33:58,230 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 514 flow. Second operand 3 states and 694 transitions. [2025-02-08 05:33:58,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 251 transitions, 596 flow [2025-02-08 05:33:58,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:58,234 INFO L231 Difference]: Finished difference. Result has 247 places, 245 transitions, 516 flow [2025-02-08 05:33:58,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=247, PETRI_TRANSITIONS=245} [2025-02-08 05:33:58,236 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 0 predicate places. [2025-02-08 05:33:58,236 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 245 transitions, 516 flow [2025-02-08 05:33:58,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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-02-08 05:33:58,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:58,237 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] [2025-02-08 05:33:58,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:33:58,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:58,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash 28222054, now seen corresponding path program 1 times [2025-02-08 05:33:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:58,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093030184] [2025-02-08 05:33:58,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:58,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:58,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:33:58,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:33:58,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:58,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:58,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:58,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093030184] [2025-02-08 05:33:58,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093030184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:58,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169744207] [2025-02-08 05:33:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:58,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:58,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:58,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 263 [2025-02-08 05:33:58,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 245 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-02-08 05:33:58,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:58,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 263 [2025-02-08 05:33:58,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:58,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:58,872 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2025-02-08 05:33:58,872 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2025-02-08 05:33:58,872 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is not cut-off event [2025-02-08 05:33:58,872 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2025-02-08 05:33:59,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 19#t_funENTRYtrue, 245#true, 256#true]) [2025-02-08 05:33:59,243 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-02-08 05:33:59,243 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-02-08 05:33:59,243 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-02-08 05:33:59,243 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-02-08 05:33:59,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 191#t_funENTRYtrue, 246#true, 256#true]) [2025-02-08 05:33:59,247 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-02-08 05:33:59,247 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-02-08 05:33:59,247 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-02-08 05:33:59,247 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-02-08 05:33:59,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, 101#L938true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,280 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is not cut-off event [2025-02-08 05:33:59,280 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is not cut-off event [2025-02-08 05:33:59,280 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is not cut-off event [2025-02-08 05:33:59,280 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-02-08 05:33:59,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, 27#L938true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 247#true, 246#true, 256#true]) [2025-02-08 05:33:59,283 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-02-08 05:33:59,284 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-02-08 05:33:59,284 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-02-08 05:33:59,284 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-02-08 05:33:59,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, 170#L939-36true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,351 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-02-08 05:33:59,351 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-02-08 05:33:59,351 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-02-08 05:33:59,351 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-02-08 05:33:59,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][274], [34#L939-33true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 262#(= |#race~global~0| 0), 245#true, 256#true]) [2025-02-08 05:33:59,351 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-02-08 05:33:59,351 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:33:59,351 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-08 05:33:59,351 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-08 05:33:59,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, 111#L939-36true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 246#true, 256#true]) [2025-02-08 05:33:59,355 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:33:59,356 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-08 05:33:59,356 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-08 05:33:59,356 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:33:59,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][274], [248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 262#(= |#race~global~0| 0), 245#true, 256#true, 23#L939-34true]) [2025-02-08 05:33:59,386 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-02-08 05:33:59,386 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:33:59,386 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:33:59,386 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-08 05:33:59,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 34#L939-33true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,387 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is not cut-off event [2025-02-08 05:33:59,387 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is not cut-off event [2025-02-08 05:33:59,387 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is not cut-off event [2025-02-08 05:33:59,387 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is not cut-off event [2025-02-08 05:33:59,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 201#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,387 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-02-08 05:33:59,387 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-08 05:33:59,387 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:33:59,387 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:33:59,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true, 23#L939-34true]) [2025-02-08 05:33:59,403 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is not cut-off event [2025-02-08 05:33:59,403 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is not cut-off event [2025-02-08 05:33:59,403 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is not cut-off event [2025-02-08 05:33:59,403 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-02-08 05:33:59,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 98#L939-28true, 246#true, 256#true]) [2025-02-08 05:33:59,524 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-02-08 05:33:59,524 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-08 05:33:59,524 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-08 05:33:59,524 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-08 05:33:59,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 83#L939-28true, 245#true, 256#true]) [2025-02-08 05:33:59,527 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is not cut-off event [2025-02-08 05:33:59,527 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-02-08 05:33:59,527 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-02-08 05:33:59,527 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-02-08 05:33:59,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 145#L939-23true, 246#true, 256#true]) [2025-02-08 05:33:59,561 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-02-08 05:33:59,561 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-08 05:33:59,561 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-08 05:33:59,561 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-08 05:33:59,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 123#L939-23true, 245#true, 256#true]) [2025-02-08 05:33:59,564 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is not cut-off event [2025-02-08 05:33:59,564 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-02-08 05:33:59,564 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-02-08 05:33:59,564 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2025-02-08 05:33:59,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 246#true, 163#L939-17true, 256#true]) [2025-02-08 05:33:59,588 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:33:59,588 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-08 05:33:59,588 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:33:59,588 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:33:59,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 236#L939-17true, 245#true, 256#true]) [2025-02-08 05:33:59,590 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is not cut-off event [2025-02-08 05:33:59,590 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is not cut-off event [2025-02-08 05:33:59,591 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is not cut-off event [2025-02-08 05:33:59,591 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is not cut-off event [2025-02-08 05:33:59,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][273], [Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 262#(= |#race~global~0| 0), 246#true, 178#L939-14true, 256#true]) [2025-02-08 05:33:59,596 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-02-08 05:33:59,596 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,596 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,596 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:33:59,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 194#L939-14true, 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,602 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is not cut-off event [2025-02-08 05:33:59,602 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-02-08 05:33:59,602 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-02-08 05:33:59,602 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2025-02-08 05:33:59,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, 189#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,602 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,602 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,602 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,602 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-02-08 05:33:59,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][273], [Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 162#L939-15true, 262#(= |#race~global~0| 0), 246#true, 256#true]) [2025-02-08 05:33:59,602 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 246#true, 178#L939-14true, 256#true]) [2025-02-08 05:33:59,603 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is not cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-02-08 05:33:59,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 108#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#true, 256#true]) [2025-02-08 05:33:59,603 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,603 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, 26#L939-15true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 245#true, 256#true]) [2025-02-08 05:33:59,608 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 162#L939-15true, 246#true, 256#true]) [2025-02-08 05:33:59,608 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-02-08 05:33:59,608 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-02-08 05:33:59,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 56#L939-9true, 246#true, 256#true]) [2025-02-08 05:33:59,624 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-02-08 05:33:59,624 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:33:59,624 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:33:59,624 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:33:59,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 192#L939-9true, 245#true, 256#true]) [2025-02-08 05:33:59,632 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][274], [248#true, 26#L939-15true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 262#(= |#race~global~0| 0), 245#true, 256#true]) [2025-02-08 05:33:59,633 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][274], [248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 194#L939-14true, 20#L952-3true, 262#(= |#race~global~0| 0), 245#true, 256#true]) [2025-02-08 05:33:59,633 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,633 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:33:59,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 159#L939-4true, 246#true, 256#true]) [2025-02-08 05:33:59,638 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-02-08 05:33:59,638 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:33:59,639 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-02-08 05:33:59,639 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:33:59,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 85#L939-4true, 245#true, 256#true]) [2025-02-08 05:33:59,640 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is not cut-off event [2025-02-08 05:33:59,640 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-02-08 05:33:59,640 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2025-02-08 05:33:59,640 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-02-08 05:33:59,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([830] t_funEXIT-->L952-3: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [260#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 247#true, 20#L952-3true, 14#L940true, 246#true, 256#true]) [2025-02-08 05:33:59,649 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2025-02-08 05:33:59,649 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:33:59,649 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-02-08 05:33:59,650 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:33:59,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] t_funEXIT-->L952-3: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][246], [260#true, 248#true, Black: 258#(= |ULTIMATE.start_main_~i~1#1| 0), 20#L952-3true, 15#L940true, 245#true, 256#true]) [2025-02-08 05:33:59,650 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2025-02-08 05:33:59,650 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is not cut-off event [2025-02-08 05:33:59,650 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2025-02-08 05:33:59,650 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2025-02-08 05:33:59,666 INFO L124 PetriNetUnfolderBase]: 4754/15819 cut-off events. [2025-02-08 05:33:59,666 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2025-02-08 05:33:59,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23199 conditions, 15819 events. 4754/15819 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 176727 event pairs, 1581 based on Foata normal form. 0/13991 useless extension candidates. Maximal degree in co-relation 23088. Up to 3673 conditions per place. [2025-02-08 05:33:59,742 INFO L140 encePairwiseOnDemand]: 244/263 looper letters, 58 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2025-02-08 05:33:59,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 278 transitions, 737 flow [2025-02-08 05:33:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2025-02-08 05:33:59,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8846641318124208 [2025-02-08 05:33:59,744 INFO L175 Difference]: Start difference. First operand has 247 places, 245 transitions, 516 flow. Second operand 3 states and 698 transitions. [2025-02-08 05:33:59,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 278 transitions, 737 flow [2025-02-08 05:33:59,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 278 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:33:59,750 INFO L231 Difference]: Finished difference. Result has 250 places, 259 transitions, 636 flow [2025-02-08 05:33:59,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=250, PETRI_TRANSITIONS=259} [2025-02-08 05:33:59,751 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 3 predicate places. [2025-02-08 05:33:59,752 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 259 transitions, 636 flow [2025-02-08 05:33:59,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-02-08 05:33:59,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:59,752 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] [2025-02-08 05:33:59,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:33:59,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:59,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash 590953647, now seen corresponding path program 1 times [2025-02-08 05:33:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:59,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546122400] [2025-02-08 05:33:59,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:59,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:33:59,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:33:59,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:59,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546122400] [2025-02-08 05:33:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546122400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:59,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:59,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374004410] [2025-02-08 05:33:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:59,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:59,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:59,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:59,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 263 [2025-02-08 05:33:59,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 259 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-02-08 05:33:59,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:59,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 263 [2025-02-08 05:33:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:01,470 INFO L124 PetriNetUnfolderBase]: 4872/18188 cut-off events. [2025-02-08 05:34:01,470 INFO L125 PetriNetUnfolderBase]: For 4525/4704 co-relation queries the response was YES. [2025-02-08 05:34:01,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29687 conditions, 18188 events. 4872/18188 cut-off events. For 4525/4704 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 217112 event pairs, 2424 based on Foata normal form. 47/16419 useless extension candidates. Maximal degree in co-relation 28163. Up to 6154 conditions per place. [2025-02-08 05:34:01,583 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 52 selfloop transitions, 14 changer transitions 0/283 dead transitions. [2025-02-08 05:34:01,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 283 transitions, 854 flow [2025-02-08 05:34:01,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2025-02-08 05:34:01,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770595690747782 [2025-02-08 05:34:01,585 INFO L175 Difference]: Start difference. First operand has 250 places, 259 transitions, 636 flow. Second operand 3 states and 692 transitions. [2025-02-08 05:34:01,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 283 transitions, 854 flow [2025-02-08 05:34:01,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 283 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:01,596 INFO L231 Difference]: Finished difference. Result has 252 places, 271 transitions, 734 flow [2025-02-08 05:34:01,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=252, PETRI_TRANSITIONS=271} [2025-02-08 05:34:01,597 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 5 predicate places. [2025-02-08 05:34:01,597 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 271 transitions, 734 flow [2025-02-08 05:34:01,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-02-08 05:34:01,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:01,598 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-02-08 05:34:01,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:34:01,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash 149664254, now seen corresponding path program 1 times [2025-02-08 05:34:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:01,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728474383] [2025-02-08 05:34:01,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:01,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:34:01,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:34:01,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:01,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:01,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728474383] [2025-02-08 05:34:01,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728474383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:01,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:01,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867284767] [2025-02-08 05:34:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:01,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:34:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:01,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:34:01,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:34:01,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2025-02-08 05:34:01,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 271 transitions, 734 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-02-08 05:34:01,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:01,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2025-02-08 05:34:01,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:03,379 INFO L124 PetriNetUnfolderBase]: 3184/19562 cut-off events. [2025-02-08 05:34:03,380 INFO L125 PetriNetUnfolderBase]: For 1468/3191 co-relation queries the response was YES. [2025-02-08 05:34:03,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26695 conditions, 19562 events. 3184/19562 cut-off events. For 1468/3191 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 255863 event pairs, 420 based on Foata normal form. 14/17106 useless extension candidates. Maximal degree in co-relation 12185. Up to 3493 conditions per place. [2025-02-08 05:34:03,443 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 56 selfloop transitions, 5 changer transitions 0/303 dead transitions. [2025-02-08 05:34:03,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 303 transitions, 920 flow [2025-02-08 05:34:03,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1370 transitions. [2025-02-08 05:34:03,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681875792141952 [2025-02-08 05:34:03,446 INFO L175 Difference]: Start difference. First operand has 252 places, 271 transitions, 734 flow. Second operand 6 states and 1370 transitions. [2025-02-08 05:34:03,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 303 transitions, 920 flow [2025-02-08 05:34:03,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 303 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:03,454 INFO L231 Difference]: Finished difference. Result has 258 places, 273 transitions, 732 flow [2025-02-08 05:34:03,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=732, PETRI_PLACES=258, PETRI_TRANSITIONS=273} [2025-02-08 05:34:03,455 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 11 predicate places. [2025-02-08 05:34:03,455 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 273 transitions, 732 flow [2025-02-08 05:34:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-02-08 05:34:03,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:03,456 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, 1, 1, 1, 1] [2025-02-08 05:34:03,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:34:03,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:34:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2122177283, now seen corresponding path program 1 times [2025-02-08 05:34:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326601544] [2025-02-08 05:34:03,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:34:03,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:34:03,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:03,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:03,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:03,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:34:03,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:34:03,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:03,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:03,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:03,510 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-08 05:34:03,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:34:03,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:34:03,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:34:03,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:34:03,511 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:03,511 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:34:03,539 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:34:03,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 314 transitions, 655 flow [2025-02-08 05:34:03,582 INFO L124 PetriNetUnfolderBase]: 54/615 cut-off events. [2025-02-08 05:34:03,582 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:34:03,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 615 events. 54/615 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2228 event pairs, 1 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 434. Up to 12 conditions per place. [2025-02-08 05:34:03,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 314 transitions, 655 flow [2025-02-08 05:34:03,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 293 places, 314 transitions, 655 flow [2025-02-08 05:34:03,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:03,594 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;@5b2173f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:03,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 05:34:03,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:03,598 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2025-02-08 05:34:03,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:03,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:03,598 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] [2025-02-08 05:34:03,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:34:03,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1401706241, now seen corresponding path program 1 times [2025-02-08 05:34:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457957359] [2025-02-08 05:34:03,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:03,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:34:03,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:34:03,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:03,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457957359] [2025-02-08 05:34:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457957359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:03,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:03,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106909546] [2025-02-08 05:34:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:03,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:03,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:03,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 314 [2025-02-08 05:34:03,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 314 transitions, 655 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-02-08 05:34:03,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:03,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 314 [2025-02-08 05:34:03,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:09,495 INFO L124 PetriNetUnfolderBase]: 18812/54519 cut-off events. [2025-02-08 05:34:09,496 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2025-02-08 05:34:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80932 conditions, 54519 events. 18812/54519 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 690607 event pairs, 2086 based on Foata normal form. 19386/68960 useless extension candidates. Maximal degree in co-relation 9277. Up to 18109 conditions per place. [2025-02-08 05:34:09,756 INFO L140 encePairwiseOnDemand]: 286/314 looper letters, 112 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-02-08 05:34:09,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 361 transitions, 983 flow [2025-02-08 05:34:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2025-02-08 05:34:09,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927813163481954 [2025-02-08 05:34:09,760 INFO L175 Difference]: Start difference. First operand has 293 places, 314 transitions, 655 flow. Second operand 6 states and 1682 transitions. [2025-02-08 05:34:09,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 361 transitions, 983 flow [2025-02-08 05:34:09,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 361 transitions, 983 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:09,764 INFO L231 Difference]: Finished difference. Result has 295 places, 289 transitions, 615 flow [2025-02-08 05:34:09,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=295, PETRI_TRANSITIONS=289} [2025-02-08 05:34:09,765 INFO L279 CegarLoopForPetriNet]: 293 programPoint places, 2 predicate places. [2025-02-08 05:34:09,765 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 289 transitions, 615 flow [2025-02-08 05:34:09,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-02-08 05:34:09,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:09,766 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] [2025-02-08 05:34:09,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:34:09,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:34:09,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1735735076, now seen corresponding path program 1 times [2025-02-08 05:34:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:09,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777805261] [2025-02-08 05:34:09,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:09,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:34:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:34:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:09,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:09,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777805261] [2025-02-08 05:34:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777805261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:09,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557921623] [2025-02-08 05:34:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:09,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:09,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:09,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:09,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 314 [2025-02-08 05:34:09,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 289 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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-02-08 05:34:09,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:09,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 314 [2025-02-08 05:34:09,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:13,825 INFO L124 PetriNetUnfolderBase]: 10320/38305 cut-off events. [2025-02-08 05:34:13,826 INFO L125 PetriNetUnfolderBase]: For 1819/1819 co-relation queries the response was YES. [2025-02-08 05:34:13,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53423 conditions, 38305 events. 10320/38305 cut-off events. For 1819/1819 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 498130 event pairs, 8298 based on Foata normal form. 1/34628 useless extension candidates. Maximal degree in co-relation 38924. Up to 14093 conditions per place. [2025-02-08 05:34:14,056 INFO L140 encePairwiseOnDemand]: 311/314 looper letters, 39 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-02-08 05:34:14,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 713 flow [2025-02-08 05:34:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-02-08 05:34:14,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630573248407644 [2025-02-08 05:34:14,058 INFO L175 Difference]: Start difference. First operand has 295 places, 289 transitions, 615 flow. Second operand 3 states and 813 transitions. [2025-02-08 05:34:14,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 713 flow [2025-02-08 05:34:14,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 296 transitions, 701 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:14,062 INFO L231 Difference]: Finished difference. Result has 293 places, 290 transitions, 617 flow [2025-02-08 05:34:14,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=293, PETRI_TRANSITIONS=290} [2025-02-08 05:34:14,063 INFO L279 CegarLoopForPetriNet]: 293 programPoint places, 0 predicate places. [2025-02-08 05:34:14,063 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 290 transitions, 617 flow [2025-02-08 05:34:14,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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-02-08 05:34:14,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:14,064 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] [2025-02-08 05:34:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:34:14,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:34:14,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1884035319, now seen corresponding path program 1 times [2025-02-08 05:34:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309341872] [2025-02-08 05:34:14,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:14,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:34:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:34:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309341872] [2025-02-08 05:34:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309341872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964799670] [2025-02-08 05:34:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:14,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:14,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:14,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:14,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 314 [2025-02-08 05:34:14,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 290 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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-02-08 05:34:14,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:14,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 314 [2025-02-08 05:34:14,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand