./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:56,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:56,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:56,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:56,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:56,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:56,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:56,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:56,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:56,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:56,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:56,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:56,400 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:56,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:56,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:56,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:56,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:56,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:56,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:56,403 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-04-30 10:26:56,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:56,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:56,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:56,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:56,601 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:56,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.i [2025-04-30 10:26:57,849 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49843ba8c/f81e4c778e0e41f1b697b49e4a3f3b0e/FLAG113e2aa08 [2025-04-30 10:26:58,096 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:58,097 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.i [2025-04-30 10:26:58,110 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49843ba8c/f81e4c778e0e41f1b697b49e4a3f3b0e/FLAG113e2aa08 [2025-04-30 10:26:58,900 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49843ba8c/f81e4c778e0e41f1b697b49e4a3f3b0e [2025-04-30 10:26:58,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:58,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:58,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:58,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:58,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:58,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:58" (1/1) ... [2025-04-30 10:26:58,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404b6031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:58, skipping insertion in model container [2025-04-30 10:26:58,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:58" (1/1) ... [2025-04-30 10:26:58,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:59,345 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:59,360 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:59,441 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:59,492 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:59,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59 WrapperNode [2025-04-30 10:26:59,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:59,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:59,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:59,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:59,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,548 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 199 [2025-04-30 10:26:59,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:59,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:59,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:59,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:59,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:59,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:59,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:59,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:59,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (1/1) ... [2025-04-30 10:26:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:59,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:59,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:26:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:26:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:59,637 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:59,752 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:59,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:27:00,172 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:27:00,172 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:27:00,202 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:27:00,204 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:27:00,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:00 BoogieIcfgContainer [2025-04-30 10:27:00,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:27:00,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:27:00,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:27:00,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:27:00,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:58" (1/3) ... [2025-04-30 10:27:00,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9cbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:00, skipping insertion in model container [2025-04-30 10:27:00,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:59" (2/3) ... [2025-04-30 10:27:00,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9cbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:00, skipping insertion in model container [2025-04-30 10:27:00,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:00" (3/3) ... [2025-04-30 10:27:00,214 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-04-30 10:27:00,225 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:27:00,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 304 locations, 302 edges, 1 initial locations, 0 loop locations, and 30 error locations. [2025-04-30 10:27:00,228 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:27:00,277 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:27:00,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 303 transitions, 610 flow [2025-04-30 10:27:00,392 INFO L116 PetriNetUnfolderBase]: 0/302 cut-off events. [2025-04-30 10:27:00,394 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:00,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 302 events. 0/302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 162 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-30 10:27:00,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 303 transitions, 610 flow [2025-04-30 10:27:00,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 302 transitions, 607 flow [2025-04-30 10:27:00,416 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:27:00,430 INFO L340 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;@530f96be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:27:00,430 INFO L341 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-04-30 10:27:00,438 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:27:00,438 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-30 10:27:00,438 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:00,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:00,439 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] [2025-04-30 10:27:00,440 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:00,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 665820996, now seen corresponding path program 1 times [2025-04-30 10:27:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:00,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78358744] [2025-04-30 10:27:00,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:00,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:00,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:27:00,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:27:00,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:00,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:01,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78358744] [2025-04-30 10:27:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78358744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:01,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:01,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794206567] [2025-04-30 10:27:01,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:01,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:01,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:01,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:01,694 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 303 [2025-04-30 10:27:01,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-04-30 10:27:01,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:01,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 303 [2025-04-30 10:27:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:02,110 INFO L116 PetriNetUnfolderBase]: 560/2351 cut-off events. [2025-04-30 10:27:02,110 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:02,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 2351 events. 560/2351 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14877 event pairs, 560 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3350. Up to 1198 conditions per place. [2025-04-30 10:27:02,128 INFO L140 encePairwiseOnDemand]: 279/303 looper letters, 77 selfloop transitions, 20 changer transitions 0/298 dead transitions. [2025-04-30 10:27:02,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 298 transitions, 793 flow [2025-04-30 10:27:02,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-04-30 10:27:02,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-04-30 10:27:02,148 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 607 flow. Second operand 6 states and 1313 transitions. [2025-04-30 10:27:02,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 298 transitions, 793 flow [2025-04-30 10:27:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 298 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:02,160 INFO L231 Difference]: Finished difference. Result has 306 places, 298 transitions, 638 flow [2025-04-30 10:27:02,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=306, PETRI_TRANSITIONS=298} [2025-04-30 10:27:02,167 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 0 predicate places. [2025-04-30 10:27:02,167 INFO L485 AbstractCegarLoop]: Abstraction has has 306 places, 298 transitions, 638 flow [2025-04-30 10:27:02,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-04-30 10:27:02,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,168 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] [2025-04-30 10:27:02,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:02,169 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:02,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -806874686, now seen corresponding path program 1 times [2025-04-30 10:27:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054253489] [2025-04-30 10:27:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:27:02,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:27:02,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:02,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:02,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:02,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054253489] [2025-04-30 10:27:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054253489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345099518] [2025-04-30 10:27:02,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:02,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:02,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:02,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:02,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 303 [2025-04-30 10:27:02,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-04-30 10:27:02,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 303 [2025-04-30 10:27:02,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,283 INFO L116 PetriNetUnfolderBase]: 560/2347 cut-off events. [2025-04-30 10:27:03,284 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:03,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 2347 events. 560/2347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14857 event pairs, 560 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3391. Up to 1198 conditions per place. [2025-04-30 10:27:03,291 INFO L140 encePairwiseOnDemand]: 279/303 looper letters, 77 selfloop transitions, 20 changer transitions 0/294 dead transitions. [2025-04-30 10:27:03,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 824 flow [2025-04-30 10:27:03,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-04-30 10:27:03,293 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-04-30 10:27:03,294 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 638 flow. Second operand 6 states and 1313 transitions. [2025-04-30 10:27:03,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 824 flow [2025-04-30 10:27:03,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 294 transitions, 784 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:03,297 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 630 flow [2025-04-30 10:27:03,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=302, PETRI_TRANSITIONS=294} [2025-04-30 10:27:03,298 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -4 predicate places. [2025-04-30 10:27:03,298 INFO L485 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 630 flow [2025-04-30 10:27:03,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-04-30 10:27:03,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,299 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] [2025-04-30 10:27:03,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:27:03,300 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:03,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1190899758, now seen corresponding path program 1 times [2025-04-30 10:27:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590929193] [2025-04-30 10:27:03,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:27:03,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:27:03,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:03,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590929193] [2025-04-30 10:27:03,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590929193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:03,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278325350] [2025-04-30 10:27:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:03,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:03,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-04-30 10:27:03,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 294 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-04-30 10:27:03,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-04-30 10:27:03,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,429 INFO L116 PetriNetUnfolderBase]: 30/743 cut-off events. [2025-04-30 10:27:03,429 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:03,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 743 events. 30/743 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2643 event pairs, 30 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-04-30 10:27:03,432 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 17 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-04-30 10:27:03,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 293 transitions, 666 flow [2025-04-30 10:27:03,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-04-30 10:27:03,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9559955995599559 [2025-04-30 10:27:03,434 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 630 flow. Second operand 3 states and 869 transitions. [2025-04-30 10:27:03,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 293 transitions, 666 flow [2025-04-30 10:27:03,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:03,437 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 592 flow [2025-04-30 10:27:03,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-04-30 10:27:03,438 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2025-04-30 10:27:03,438 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 592 flow [2025-04-30 10:27:03,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-04-30 10:27:03,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,439 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] [2025-04-30 10:27:03,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:03,439 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:03,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash -51795839, now seen corresponding path program 1 times [2025-04-30 10:27:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295084818] [2025-04-30 10:27:03,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:27:03,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:27:03,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295084818] [2025-04-30 10:27:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295084818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:03,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019028390] [2025-04-30 10:27:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:03,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:03,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:03,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-04-30 10:27:03,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-04-30 10:27:03,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-04-30 10:27:03,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,573 INFO L116 PetriNetUnfolderBase]: 36/775 cut-off events. [2025-04-30 10:27:03,573 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:03,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 775 events. 36/775 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2999 event pairs, 36 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 813. Up to 89 conditions per place. [2025-04-30 10:27:03,575 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 17 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2025-04-30 10:27:03,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 289 transitions, 620 flow [2025-04-30 10:27:03,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-04-30 10:27:03,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9515951595159516 [2025-04-30 10:27:03,577 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 592 flow. Second operand 3 states and 865 transitions. [2025-04-30 10:27:03,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 289 transitions, 620 flow [2025-04-30 10:27:03,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 289 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:03,580 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 582 flow [2025-04-30 10:27:03,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2025-04-30 10:27:03,581 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2025-04-30 10:27:03,581 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 582 flow [2025-04-30 10:27:03,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-04-30 10:27:03,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:03,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:27:03,582 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:03,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1997372483, now seen corresponding path program 1 times [2025-04-30 10:27:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881614506] [2025-04-30 10:27:03,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:27:03,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:27:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:03,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881614506] [2025-04-30 10:27:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881614506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449312104] [2025-04-30 10:27:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:03,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:04,236 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 303 [2025-04-30 10:27:04,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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-04-30 10:27:04,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:04,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 303 [2025-04-30 10:27:04,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:04,621 INFO L116 PetriNetUnfolderBase]: 638/2544 cut-off events. [2025-04-30 10:27:04,622 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:04,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2544 events. 638/2544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16231 event pairs, 638 based on Foata normal form. 0/2342 useless extension candidates. Maximal degree in co-relation 3855. Up to 1370 conditions per place. [2025-04-30 10:27:04,632 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 93 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-04-30 10:27:04,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 288 transitions, 776 flow [2025-04-30 10:27:04,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-04-30 10:27:04,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7277227722772277 [2025-04-30 10:27:04,637 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 582 flow. Second operand 6 states and 1323 transitions. [2025-04-30 10:27:04,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 288 transitions, 776 flow [2025-04-30 10:27:04,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 288 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:04,642 INFO L231 Difference]: Finished difference. Result has 297 places, 288 transitions, 589 flow [2025-04-30 10:27:04,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=297, PETRI_TRANSITIONS=288} [2025-04-30 10:27:04,645 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -9 predicate places. [2025-04-30 10:27:04,645 INFO L485 AbstractCegarLoop]: Abstraction has has 297 places, 288 transitions, 589 flow [2025-04-30 10:27:04,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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-04-30 10:27:04,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:04,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:04,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:27:04,647 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:04,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1310489849, now seen corresponding path program 1 times [2025-04-30 10:27:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:04,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729568415] [2025-04-30 10:27:04,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:27:04,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:27:04,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:04,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:04,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729568415] [2025-04-30 10:27:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729568415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027011481] [2025-04-30 10:27:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:04,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:04,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:04,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:04,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-04-30 10:27:04,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 288 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-04-30 10:27:04,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:04,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-04-30 10:27:04,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:04,777 INFO L116 PetriNetUnfolderBase]: 30/731 cut-off events. [2025-04-30 10:27:04,777 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:04,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 731 events. 30/731 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2651 event pairs, 30 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 762. Up to 78 conditions per place. [2025-04-30 10:27:04,780 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 17 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-04-30 10:27:04,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 625 flow [2025-04-30 10:27:04,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-04-30 10:27:04,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9559955995599559 [2025-04-30 10:27:04,782 INFO L175 Difference]: Start difference. First operand has 297 places, 288 transitions, 589 flow. Second operand 3 states and 869 transitions. [2025-04-30 10:27:04,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 625 flow [2025-04-30 10:27:04,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 615 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:04,785 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 581 flow [2025-04-30 10:27:04,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2025-04-30 10:27:04,786 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2025-04-30 10:27:04,786 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 581 flow [2025-04-30 10:27:04,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-04-30 10:27:04,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:04,788 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-04-30 10:27:04,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:27:04,788 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:04,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1070039900, now seen corresponding path program 1 times [2025-04-30 10:27:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:04,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885626028] [2025-04-30 10:27:04,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:04,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-30 10:27:04,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-30 10:27:04,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:04,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:04,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885626028] [2025-04-30 10:27:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885626028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110363784] [2025-04-30 10:27:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:04,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:04,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-04-30 10:27:04,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-04-30 10:27:04,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:04,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-04-30 10:27:04,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:04,921 INFO L116 PetriNetUnfolderBase]: 36/759 cut-off events. [2025-04-30 10:27:04,921 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:04,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 759 events. 36/759 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2902 event pairs, 36 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 799. Up to 89 conditions per place. [2025-04-30 10:27:04,924 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 17 selfloop transitions, 1 changer transitions 0/283 dead transitions. [2025-04-30 10:27:04,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 283 transitions, 609 flow [2025-04-30 10:27:04,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-04-30 10:27:04,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9515951595159516 [2025-04-30 10:27:04,925 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 581 flow. Second operand 3 states and 865 transitions. [2025-04-30 10:27:04,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 283 transitions, 609 flow [2025-04-30 10:27:04,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 283 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:04,928 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 571 flow [2025-04-30 10:27:04,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2025-04-30 10:27:04,929 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2025-04-30 10:27:04,929 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 571 flow [2025-04-30 10:27:04,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-04-30 10:27:04,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:04,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:04,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:27:04,930 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:04,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1257937337, now seen corresponding path program 1 times [2025-04-30 10:27:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:04,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325472768] [2025-04-30 10:27:04,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:04,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:27:04,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:27:04,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:04,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:05,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325472768] [2025-04-30 10:27:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325472768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065004936] [2025-04-30 10:27:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:05,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:05,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:05,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:05,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 303 [2025-04-30 10:27:05,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 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-04-30 10:27:05,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:05,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 303 [2025-04-30 10:27:05,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:05,967 INFO L116 PetriNetUnfolderBase]: 638/2453 cut-off events. [2025-04-30 10:27:05,967 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:05,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 2453 events. 638/2453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15350 event pairs, 638 based on Foata normal form. 0/2306 useless extension candidates. Maximal degree in co-relation 3766. Up to 1370 conditions per place. [2025-04-30 10:27:05,976 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 93 selfloop transitions, 5 changer transitions 0/282 dead transitions. [2025-04-30 10:27:05,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 282 transitions, 765 flow [2025-04-30 10:27:05,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-04-30 10:27:05,978 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7277227722772277 [2025-04-30 10:27:05,978 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 571 flow. Second operand 6 states and 1323 transitions. [2025-04-30 10:27:05,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 282 transitions, 765 flow [2025-04-30 10:27:05,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 282 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:05,982 INFO L231 Difference]: Finished difference. Result has 292 places, 282 transitions, 578 flow [2025-04-30 10:27:05,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=292, PETRI_TRANSITIONS=282} [2025-04-30 10:27:05,982 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2025-04-30 10:27:05,982 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 282 transitions, 578 flow [2025-04-30 10:27:05,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 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-04-30 10:27:05,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:05,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:05,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:05,984 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:05,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1020988562, now seen corresponding path program 1 times [2025-04-30 10:27:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:05,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582315961] [2025-04-30 10:27:05,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-04-30 10:27:06,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-04-30 10:27:06,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:06,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582315961] [2025-04-30 10:27:06,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582315961] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:06,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:06,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964670486] [2025-04-30 10:27:06,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:06,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:06,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:06,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:06,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 303 [2025-04-30 10:27:06,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 282 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-04-30 10:27:06,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:06,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 303 [2025-04-30 10:27:06,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:07,163 INFO L116 PetriNetUnfolderBase]: 232/1812 cut-off events. [2025-04-30 10:27:07,163 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:07,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1812 events. 232/1812 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11411 event pairs, 20 based on Foata normal form. 0/1688 useless extension candidates. Maximal degree in co-relation 2310. Up to 313 conditions per place. [2025-04-30 10:27:07,170 INFO L140 encePairwiseOnDemand]: 284/303 looper letters, 108 selfloop transitions, 38 changer transitions 0/356 dead transitions. [2025-04-30 10:27:07,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 356 transitions, 1018 flow [2025-04-30 10:27:07,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1534 transitions. [2025-04-30 10:27:07,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8437843784378438 [2025-04-30 10:27:07,173 INFO L175 Difference]: Start difference. First operand has 292 places, 282 transitions, 578 flow. Second operand 6 states and 1534 transitions. [2025-04-30 10:27:07,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 356 transitions, 1018 flow [2025-04-30 10:27:07,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 356 transitions, 1008 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:07,180 INFO L231 Difference]: Finished difference. Result has 296 places, 318 transitions, 826 flow [2025-04-30 10:27:07,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=296, PETRI_TRANSITIONS=318} [2025-04-30 10:27:07,181 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2025-04-30 10:27:07,181 INFO L485 AbstractCegarLoop]: Abstraction has has 296 places, 318 transitions, 826 flow [2025-04-30 10:27:07,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-04-30 10:27:07,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:07,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:07,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:07,182 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:07,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1700975626, now seen corresponding path program 1 times [2025-04-30 10:27:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:07,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748368161] [2025-04-30 10:27:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-04-30 10:27:07,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-04-30 10:27:07,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:07,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:07,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748368161] [2025-04-30 10:27:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748368161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881725179] [2025-04-30 10:27:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:07,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:07,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:07,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:07,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2025-04-30 10:27:07,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 318 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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-04-30 10:27:07,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:07,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2025-04-30 10:27:07,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:08,178 INFO L116 PetriNetUnfolderBase]: 185/1616 cut-off events. [2025-04-30 10:27:08,178 INFO L117 PetriNetUnfolderBase]: For 202/207 co-relation queries the response was YES. [2025-04-30 10:27:08,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1616 events. 185/1616 cut-off events. For 202/207 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9962 event pairs, 75 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 2326. Up to 362 conditions per place. [2025-04-30 10:27:08,185 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 104 selfloop transitions, 5 changer transitions 0/333 dead transitions. [2025-04-30 10:27:08,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 333 transitions, 1074 flow [2025-04-30 10:27:08,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-04-30 10:27:08,188 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8272827282728272 [2025-04-30 10:27:08,189 INFO L175 Difference]: Start difference. First operand has 296 places, 318 transitions, 826 flow. Second operand 6 states and 1504 transitions. [2025-04-30 10:27:08,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 333 transitions, 1074 flow [2025-04-30 10:27:08,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 333 transitions, 1074 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:08,196 INFO L231 Difference]: Finished difference. Result has 300 places, 317 transitions, 834 flow [2025-04-30 10:27:08,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=834, PETRI_PLACES=300, PETRI_TRANSITIONS=317} [2025-04-30 10:27:08,197 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -6 predicate places. [2025-04-30 10:27:08,198 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 317 transitions, 834 flow [2025-04-30 10:27:08,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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-04-30 10:27:08,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:08,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:08,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:08,199 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:08,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1294831474, now seen corresponding path program 1 times [2025-04-30 10:27:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:08,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296652384] [2025-04-30 10:27:08,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:08,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-04-30 10:27:08,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-04-30 10:27:08,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:08,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:27:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:08,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296652384] [2025-04-30 10:27:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296652384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:08,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113209704] [2025-04-30 10:27:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:08,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:08,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:08,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:08,993 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 303 [2025-04-30 10:27:08,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 317 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 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-04-30 10:27:08,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:08,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 303 [2025-04-30 10:27:08,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:09,277 INFO L116 PetriNetUnfolderBase]: 583/2973 cut-off events. [2025-04-30 10:27:09,277 INFO L117 PetriNetUnfolderBase]: For 700/707 co-relation queries the response was YES. [2025-04-30 10:27:09,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 2973 events. 583/2973 cut-off events. For 700/707 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21736 event pairs, 69 based on Foata normal form. 0/2786 useless extension candidates. Maximal degree in co-relation 4987. Up to 804 conditions per place. [2025-04-30 10:27:09,287 INFO L140 encePairwiseOnDemand]: 281/303 looper letters, 120 selfloop transitions, 72 changer transitions 0/406 dead transitions. [2025-04-30 10:27:09,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 406 transitions, 1588 flow [2025-04-30 10:27:09,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2025-04-30 10:27:09,290 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8283828382838284 [2025-04-30 10:27:09,290 INFO L175 Difference]: Start difference. First operand has 300 places, 317 transitions, 834 flow. Second operand 6 states and 1506 transitions. [2025-04-30 10:27:09,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 406 transitions, 1588 flow [2025-04-30 10:27:09,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 406 transitions, 1570 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:09,297 INFO L231 Difference]: Finished difference. Result has 305 places, 387 transitions, 1490 flow [2025-04-30 10:27:09,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=305, PETRI_TRANSITIONS=387} [2025-04-30 10:27:09,298 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -1 predicate places. [2025-04-30 10:27:09,298 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 387 transitions, 1490 flow [2025-04-30 10:27:09,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 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-04-30 10:27:09,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:09,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:09,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:27:09,299 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:09,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1841072123, now seen corresponding path program 1 times [2025-04-30 10:27:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:09,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109320376] [2025-04-30 10:27:09,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:09,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-04-30 10:27:09,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-04-30 10:27:09,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:09,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:27:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109320376] [2025-04-30 10:27:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109320376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362903321] [2025-04-30 10:27:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:09,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:09,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 303 [2025-04-30 10:27:09,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 387 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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-04-30 10:27:09,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:09,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 303 [2025-04-30 10:27:09,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:10,648 INFO L116 PetriNetUnfolderBase]: 1657/5720 cut-off events. [2025-04-30 10:27:10,648 INFO L117 PetriNetUnfolderBase]: For 3356/3416 co-relation queries the response was YES. [2025-04-30 10:27:10,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12817 conditions, 5720 events. 1657/5720 cut-off events. For 3356/3416 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45927 event pairs, 861 based on Foata normal form. 0/5391 useless extension candidates. Maximal degree in co-relation 12742. Up to 3155 conditions per place. [2025-04-30 10:27:10,671 INFO L140 encePairwiseOnDemand]: 280/303 looper letters, 209 selfloop transitions, 89 changer transitions 0/487 dead transitions. [2025-04-30 10:27:10,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 487 transitions, 2490 flow [2025-04-30 10:27:10,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-04-30 10:27:10,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7832783278327833 [2025-04-30 10:27:10,674 INFO L175 Difference]: Start difference. First operand has 305 places, 387 transitions, 1490 flow. Second operand 6 states and 1424 transitions. [2025-04-30 10:27:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 487 transitions, 2490 flow [2025-04-30 10:27:10,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 487 transitions, 2490 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:10,686 INFO L231 Difference]: Finished difference. Result has 315 places, 471 transitions, 2292 flow [2025-04-30 10:27:10,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2292, PETRI_PLACES=315, PETRI_TRANSITIONS=471} [2025-04-30 10:27:10,688 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 9 predicate places. [2025-04-30 10:27:10,688 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 471 transitions, 2292 flow [2025-04-30 10:27:10,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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-04-30 10:27:10,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:10,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:10,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:10,689 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:10,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2009852660, now seen corresponding path program 1 times [2025-04-30 10:27:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:10,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29464933] [2025-04-30 10:27:10,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:10,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-04-30 10:27:10,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-04-30 10:27:10,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:10,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:27:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:10,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29464933] [2025-04-30 10:27:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29464933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:10,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:10,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777497470] [2025-04-30 10:27:10,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:10,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:10,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:10,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:10,817 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 303 [2025-04-30 10:27:10,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 471 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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-04-30 10:27:10,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:10,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 303 [2025-04-30 10:27:10,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:10,992 INFO L116 PetriNetUnfolderBase]: 312/1992 cut-off events. [2025-04-30 10:27:10,992 INFO L117 PetriNetUnfolderBase]: For 1129/1206 co-relation queries the response was YES. [2025-04-30 10:27:10,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4136 conditions, 1992 events. 312/1992 cut-off events. For 1129/1206 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13434 event pairs, 31 based on Foata normal form. 4/1916 useless extension candidates. Maximal degree in co-relation 4063. Up to 312 conditions per place. [2025-04-30 10:27:10,998 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 10 selfloop transitions, 6 changer transitions 0/411 dead transitions. [2025-04-30 10:27:10,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 411 transitions, 1760 flow [2025-04-30 10:27:10,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-04-30 10:27:11,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9867986798679867 [2025-04-30 10:27:11,000 INFO L175 Difference]: Start difference. First operand has 315 places, 471 transitions, 2292 flow. Second operand 3 states and 897 transitions. [2025-04-30 10:27:11,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 411 transitions, 1760 flow [2025-04-30 10:27:11,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 411 transitions, 1672 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:11,013 INFO L231 Difference]: Finished difference. Result has 318 places, 409 transitions, 1662 flow [2025-04-30 10:27:11,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=318, PETRI_TRANSITIONS=409} [2025-04-30 10:27:11,014 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 12 predicate places. [2025-04-30 10:27:11,014 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 409 transitions, 1662 flow [2025-04-30 10:27:11,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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-04-30 10:27:11,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:11,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:11,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:27:11,015 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:11,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 184465762, now seen corresponding path program 1 times [2025-04-30 10:27:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:11,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637236526] [2025-04-30 10:27:11,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-04-30 10:27:11,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-04-30 10:27:11,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:27:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:11,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637236526] [2025-04-30 10:27:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637236526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:11,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442936558] [2025-04-30 10:27:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:11,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:11,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:11,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:11,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 303 [2025-04-30 10:27:11,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 409 transitions, 1662 flow. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-04-30 10:27:11,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:11,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 303 [2025-04-30 10:27:11,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:12,187 INFO L116 PetriNetUnfolderBase]: 695/3149 cut-off events. [2025-04-30 10:27:12,187 INFO L117 PetriNetUnfolderBase]: For 2988/3212 co-relation queries the response was YES. [2025-04-30 10:27:12,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 3149 events. 695/3149 cut-off events. For 2988/3212 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23997 event pairs, 52 based on Foata normal form. 20/3058 useless extension candidates. Maximal degree in co-relation 7431. Up to 749 conditions per place. [2025-04-30 10:27:12,199 INFO L140 encePairwiseOnDemand]: 284/303 looper letters, 192 selfloop transitions, 124 changer transitions 4/567 dead transitions. [2025-04-30 10:27:12,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 567 transitions, 3269 flow [2025-04-30 10:27:12,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1552 transitions. [2025-04-30 10:27:12,201 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8536853685368537 [2025-04-30 10:27:12,201 INFO L175 Difference]: Start difference. First operand has 318 places, 409 transitions, 1662 flow. Second operand 6 states and 1552 transitions. [2025-04-30 10:27:12,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 567 transitions, 3269 flow [2025-04-30 10:27:12,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 567 transitions, 3246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:12,215 INFO L231 Difference]: Finished difference. Result has 326 places, 511 transitions, 3038 flow [2025-04-30 10:27:12,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3038, PETRI_PLACES=326, PETRI_TRANSITIONS=511} [2025-04-30 10:27:12,215 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 20 predicate places. [2025-04-30 10:27:12,215 INFO L485 AbstractCegarLoop]: Abstraction has has 326 places, 511 transitions, 3038 flow [2025-04-30 10:27:12,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-04-30 10:27:12,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:12,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:12,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:12,216 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:12,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1328841865, now seen corresponding path program 1 times [2025-04-30 10:27:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:12,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339353245] [2025-04-30 10:27:12,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-04-30 10:27:12,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-04-30 10:27:12,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:12,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:27:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:12,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339353245] [2025-04-30 10:27:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339353245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:12,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311342637] [2025-04-30 10:27:12,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:12,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:12,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:12,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:12,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2025-04-30 10:27:12,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 511 transitions, 3038 flow. Second operand has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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-04-30 10:27:12,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:12,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2025-04-30 10:27:12,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:13,315 INFO L116 PetriNetUnfolderBase]: 608/2941 cut-off events. [2025-04-30 10:27:13,315 INFO L117 PetriNetUnfolderBase]: For 5493/5717 co-relation queries the response was YES. [2025-04-30 10:27:13,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7925 conditions, 2941 events. 608/2941 cut-off events. For 5493/5717 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22192 event pairs, 92 based on Foata normal form. 18/2903 useless extension candidates. Maximal degree in co-relation 7839. Up to 818 conditions per place. [2025-04-30 10:27:13,327 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 226 selfloop transitions, 17 changer transitions 0/526 dead transitions. [2025-04-30 10:27:13,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 526 transitions, 3578 flow [2025-04-30 10:27:13,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-04-30 10:27:13,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8272827282728272 [2025-04-30 10:27:13,329 INFO L175 Difference]: Start difference. First operand has 326 places, 511 transitions, 3038 flow. Second operand 6 states and 1504 transitions. [2025-04-30 10:27:13,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 526 transitions, 3578 flow [2025-04-30 10:27:13,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 526 transitions, 3560 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:13,346 INFO L231 Difference]: Finished difference. Result has 330 places, 510 transitions, 3052 flow [2025-04-30 10:27:13,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3052, PETRI_PLACES=330, PETRI_TRANSITIONS=510} [2025-04-30 10:27:13,347 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 24 predicate places. [2025-04-30 10:27:13,347 INFO L485 AbstractCegarLoop]: Abstraction has has 330 places, 510 transitions, 3052 flow [2025-04-30 10:27:13,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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-04-30 10:27:13,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:13,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:13,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:27:13,348 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:13,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1396133518, now seen corresponding path program 1 times [2025-04-30 10:27:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:13,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716197786] [2025-04-30 10:27:13,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:13,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-30 10:27:13,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-30 10:27:13,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:13,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:27:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:13,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716197786] [2025-04-30 10:27:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716197786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:13,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83393867] [2025-04-30 10:27:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:13,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:13,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:13,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:13,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 303 [2025-04-30 10:27:13,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 510 transitions, 3052 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-04-30 10:27:13,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:13,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 303 [2025-04-30 10:27:13,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:14,558 INFO L116 PetriNetUnfolderBase]: 1547/5186 cut-off events. [2025-04-30 10:27:14,558 INFO L117 PetriNetUnfolderBase]: For 7512/7591 co-relation queries the response was YES. [2025-04-30 10:27:14,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15171 conditions, 5186 events. 1547/5186 cut-off events. For 7512/7591 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41340 event pairs, 582 based on Foata normal form. 1/5034 useless extension candidates. Maximal degree in co-relation 15084. Up to 2889 conditions per place. [2025-04-30 10:27:14,578 INFO L140 encePairwiseOnDemand]: 280/303 looper letters, 312 selfloop transitions, 103 changer transitions 8/616 dead transitions. [2025-04-30 10:27:14,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 616 transitions, 4508 flow [2025-04-30 10:27:14,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-04-30 10:27:14,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7832783278327833 [2025-04-30 10:27:14,580 INFO L175 Difference]: Start difference. First operand has 330 places, 510 transitions, 3052 flow. Second operand 6 states and 1424 transitions. [2025-04-30 10:27:14,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 616 transitions, 4508 flow [2025-04-30 10:27:14,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 616 transitions, 4474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:14,606 INFO L231 Difference]: Finished difference. Result has 335 places, 596 transitions, 4036 flow [2025-04-30 10:27:14,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4036, PETRI_PLACES=335, PETRI_TRANSITIONS=596} [2025-04-30 10:27:14,607 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 29 predicate places. [2025-04-30 10:27:14,607 INFO L485 AbstractCegarLoop]: Abstraction has has 335 places, 596 transitions, 4036 flow [2025-04-30 10:27:14,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-04-30 10:27:14,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:14,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:14,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:27:14,608 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:14,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash 72147898, now seen corresponding path program 1 times [2025-04-30 10:27:14,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:14,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50964268] [2025-04-30 10:27:14,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:14,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-04-30 10:27:14,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-04-30 10:27:14,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:14,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:15,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50964268] [2025-04-30 10:27:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50964268] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:15,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155978868] [2025-04-30 10:27:15,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:15,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:15,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:15,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:27:16,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-04-30 10:27:16,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-04-30 10:27:16,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:16,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:16,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-30 10:27:16,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:16,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:27:16,277 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:27:16,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:27:16,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:27:16,412 INFO L325 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-04-30 10:27:16,412 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2025-04-30 10:27:16,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:27:16,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:27:16,731 INFO L325 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-04-30 10:27:16,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-04-30 10:27:16,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-04-30 10:27:16,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-04-30 10:27:16,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-30 10:27:17,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-30 10:27:17,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:27:17,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-30 10:27:17,095 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:17,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-30 10:27:17,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:17,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-30 10:27:17,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-30 10:27:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:17,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:17,183 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|))) is different from false [2025-04-30 10:27:17,237 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-04-30 10:27:17,254 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) (.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2 |c_t_funThread1of1ForFork0_#t~nondet36|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2355 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2355) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-04-30 10:27:19,365 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int)) (v_ArrVal_2346 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc50#1.base| v_ArrVal_2346) c_~B~0.base v_ArrVal_2347) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2025-04-30 10:27:19,752 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:19,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:19,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2025-04-30 10:27:19,760 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-04-30 10:27:19,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-04-30 10:27:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:20,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155978868] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:20,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 23] total 49 [2025-04-30 10:27:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226771538] [2025-04-30 10:27:20,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:20,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-30 10:27:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:20,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-30 10:27:20,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1777, Unknown=84, NotChecked=364, Total=2450 [2025-04-30 10:27:20,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 303 [2025-04-30 10:27:20,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 596 transitions, 4036 flow. Second operand has 50 states, 50 states have (on average 116.0) internal successors, (5800), 50 states have internal predecessors, (5800), 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-04-30 10:27:20,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:20,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 303 [2025-04-30 10:27:20,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:24,278 INFO L116 PetriNetUnfolderBase]: 2464/6918 cut-off events. [2025-04-30 10:27:24,278 INFO L117 PetriNetUnfolderBase]: For 12073/12096 co-relation queries the response was YES. [2025-04-30 10:27:24,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23162 conditions, 6918 events. 2464/6918 cut-off events. For 12073/12096 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 54304 event pairs, 845 based on Foata normal form. 15/6865 useless extension candidates. Maximal degree in co-relation 23050. Up to 3437 conditions per place. [2025-04-30 10:27:24,310 INFO L140 encePairwiseOnDemand]: 265/303 looper letters, 634 selfloop transitions, 110 changer transitions 26/870 dead transitions. [2025-04-30 10:27:24,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 870 transitions, 7382 flow [2025-04-30 10:27:24,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-30 10:27:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-30 10:27:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4239 transitions. [2025-04-30 10:27:24,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3997171145685997 [2025-04-30 10:27:24,316 INFO L175 Difference]: Start difference. First operand has 335 places, 596 transitions, 4036 flow. Second operand 35 states and 4239 transitions. [2025-04-30 10:27:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 870 transitions, 7382 flow [2025-04-30 10:27:24,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 870 transitions, 7178 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:24,365 INFO L231 Difference]: Finished difference. Result has 379 places, 634 transitions, 4534 flow [2025-04-30 10:27:24,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4534, PETRI_PLACES=379, PETRI_TRANSITIONS=634} [2025-04-30 10:27:24,366 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 73 predicate places. [2025-04-30 10:27:24,366 INFO L485 AbstractCegarLoop]: Abstraction has has 379 places, 634 transitions, 4534 flow [2025-04-30 10:27:24,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 116.0) internal successors, (5800), 50 states have internal predecessors, (5800), 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-04-30 10:27:24,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:24,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:24,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:27:24,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:27:24,572 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:24,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 396085627, now seen corresponding path program 1 times [2025-04-30 10:27:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:24,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202765156] [2025-04-30 10:27:24,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:24,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-04-30 10:27:24,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-04-30 10:27:24,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:25,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202765156] [2025-04-30 10:27:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202765156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:25,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140858827] [2025-04-30 10:27:25,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:25,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:25,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:25,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:27:26,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-04-30 10:27:26,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-04-30 10:27:26,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:26,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-30 10:27:26,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:26,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:27:26,229 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:27:26,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:27:26,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:27:26,353 INFO L325 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-04-30 10:27:26,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2025-04-30 10:27:26,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:27:26,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:27:26,641 INFO L325 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-04-30 10:27:26,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-04-30 10:27:26,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-04-30 10:27:26,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-04-30 10:27:26,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-30 10:27:26,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:27:27,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-30 10:27:27,018 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:27,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-04-30 10:27:27,035 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:27,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-04-30 10:27:27,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-30 10:27:27,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:27,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:27,466 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2781) .cse0 v_ArrVal_2786) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2781) .cse0 v_ArrVal_2786) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2781) .cse0 v_ArrVal_2786) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2781) .cse0 v_ArrVal_2786) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)))) is different from false [2025-04-30 10:27:27,500 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) (+ 6 c_~B~0.offset)) 0))))) is different from false [2025-04-30 10:27:27,515 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-04-30 10:27:27,529 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset)) (.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) .cse2))) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2781) .cse1 v_ArrVal_2786) c_~B~0.base) .cse4) 0))))) is different from false [2025-04-30 10:27:27,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:27,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2025-04-30 10:27:27,547 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:27,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 94 [2025-04-30 10:27:27,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-04-30 10:27:27,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2025-04-30 10:27:27,570 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:27,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-30 10:27:27,575 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:27,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-30 10:27:27,582 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:27,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-30 10:27:28,484 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:28,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:28,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2025-04-30 10:27:28,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-04-30 10:27:28,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-04-30 10:27:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140858827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:29,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:29,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 51 [2025-04-30 10:27:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307253874] [2025-04-30 10:27:29,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:29,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-30 10:27:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:29,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-30 10:27:29,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2005, Unknown=63, NotChecked=380, Total=2652 [2025-04-30 10:27:29,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 303 [2025-04-30 10:27:29,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 634 transitions, 4534 flow. Second operand has 52 states, 52 states have (on average 117.40384615384616) internal successors, (6105), 52 states have internal predecessors, (6105), 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-04-30 10:27:29,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:29,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 303 [2025-04-30 10:27:29,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:34,424 INFO L116 PetriNetUnfolderBase]: 2865/7976 cut-off events. [2025-04-30 10:27:34,424 INFO L117 PetriNetUnfolderBase]: For 18687/18710 co-relation queries the response was YES. [2025-04-30 10:27:34,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28327 conditions, 7976 events. 2865/7976 cut-off events. For 18687/18710 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 65244 event pairs, 654 based on Foata normal form. 12/7898 useless extension candidates. Maximal degree in co-relation 28198. Up to 2431 conditions per place. [2025-04-30 10:27:34,458 INFO L140 encePairwiseOnDemand]: 260/303 looper letters, 801 selfloop transitions, 156 changer transitions 14/1073 dead transitions. [2025-04-30 10:27:34,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1073 transitions, 9577 flow [2025-04-30 10:27:34,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:27:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-30 10:27:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4055 transitions. [2025-04-30 10:27:34,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41821369636963696 [2025-04-30 10:27:34,463 INFO L175 Difference]: Start difference. First operand has 379 places, 634 transitions, 4534 flow. Second operand 32 states and 4055 transitions. [2025-04-30 10:27:34,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1073 transitions, 9577 flow [2025-04-30 10:27:34,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1073 transitions, 9443 flow, removed 51 selfloop flow, removed 14 redundant places. [2025-04-30 10:27:34,525 INFO L231 Difference]: Finished difference. Result has 407 places, 714 transitions, 5953 flow [2025-04-30 10:27:34,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=4442, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=5953, PETRI_PLACES=407, PETRI_TRANSITIONS=714} [2025-04-30 10:27:34,526 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 101 predicate places. [2025-04-30 10:27:34,526 INFO L485 AbstractCegarLoop]: Abstraction has has 407 places, 714 transitions, 5953 flow [2025-04-30 10:27:34,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 117.40384615384616) internal successors, (6105), 52 states have internal predecessors, (6105), 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-04-30 10:27:34,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:34,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:27:34,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:34,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:27:34,728 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-30 10:27:34,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 167957259, now seen corresponding path program 2 times [2025-04-30 10:27:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:34,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928878475] [2025-04-30 10:27:34,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:34,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-04-30 10:27:34,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-04-30 10:27:34,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:27:34,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:36,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928878475] [2025-04-30 10:27:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928878475] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:36,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594048365] [2025-04-30 10:27:36,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:36,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:36,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:36,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:27:36,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-04-30 10:27:37,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-04-30 10:27:37,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:27:37,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:37,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-30 10:27:37,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:37,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:27:37,966 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:27:37,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:27:38,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:27:38,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:27:38,261 INFO L325 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-04-30 10:27:38,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2025-04-30 10:27:38,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-04-30 10:27:38,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:38,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:38,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-04-30 10:27:38,820 INFO L325 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-04-30 10:27:38,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-04-30 10:27:39,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:39,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-30 10:27:39,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-30 10:27:39,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-30 10:27:39,388 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-30 10:27:39,400 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:27:39,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-04-30 10:27:39,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:27:39,750 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:27:39,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:27:39,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-30 10:27:39,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-30 10:27:39,917 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-04-30 10:27:39,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-04-30 10:27:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:40,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:41,561 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4))) (let ((.cse0 (forall ((v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3209 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_3208) c_~B~0.base v_ArrVal_3209) c_~A~0.base) .cse2))))) (.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base|) (+ 4 |c_ULTIMATE.start_init_~p#1.offset|) 0)))) (and (or .cse0 (forall ((v_ArrVal_3210 (Array Int Int))) (not (= (select (select (store .cse1 c_~B~0.base v_ArrVal_3210) c_~A~0.base) .cse2) (+ 7 c_~B~0.offset))))) (or .cse0 (forall ((v_ArrVal_3210 (Array Int Int))) (not (= (select (select (store .cse1 c_~B~0.base v_ArrVal_3210) c_~A~0.base) .cse2) (+ 4 c_~B~0.offset))))) (or .cse0 (forall ((v_ArrVal_3210 (Array Int Int))) (not (= (select (select (store .cse1 c_~B~0.base v_ArrVal_3210) c_~A~0.base) .cse2) (+ 6 c_~B~0.offset))))) (or .cse0 (forall ((v_ArrVal_3210 (Array Int Int))) (not (= (+ 5 c_~B~0.offset) (select (select (store .cse1 c_~B~0.base v_ArrVal_3210) c_~A~0.base) .cse2)))))))) is different from false [2025-04-30 10:27:41,666 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-04-30 10:27:41,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-04-30 10:27:41,685 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-04-30 10:27:41,692 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-04-30 10:27:45,005 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,010 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2025-04-30 10:27:45,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2025-04-30 10:27:45,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-04-30 10:27:45,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-04-30 10:27:45,041 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2025-04-30 10:27:45,046 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-04-30 10:27:45,140 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2025-04-30 10:27:45,158 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2025-04-30 10:27:45,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-04-30 10:27:45,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2025-04-30 10:27:45,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-04-30 10:27:45,177 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-04-30 10:27:45,228 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2025-04-30 10:27:45,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2025-04-30 10:27:45,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-04-30 10:27:45,256 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2025-04-30 10:27:45,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-04-30 10:27:45,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-04-30 10:27:45,311 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:45,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-30 10:27:45,318 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:45,318 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:45,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:27:45,323 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:45,324 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:45,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:27:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:27:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594048365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:46,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2025-04-30 10:27:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419447417] [2025-04-30 10:27:46,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:46,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-30 10:27:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:46,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-30 10:27:46,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3851, Unknown=55, NotChecked=128, Total=4422 [2025-04-30 10:27:50,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 303 [2025-04-30 10:27:50,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 714 transitions, 5953 flow. Second operand has 67 states, 67 states have (on average 117.94029850746269) internal successors, (7902), 67 states have internal predecessors, (7902), 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-04-30 10:27:50,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:50,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 303 [2025-04-30 10:27:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15