./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:37:59,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:37:59,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:37:59,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:37:59,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:38:00,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:38:00,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:38:00,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:38:00,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:38:00,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:38:00,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:38:00,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:38:00,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:38:00,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:38:00,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:38:00,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:38:00,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:38:00,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:38:00,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:38:00,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:38:00,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:38:00,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:38:00,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:38:00,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:38:00,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:38:00,007 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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2025-03-14 01:38:00,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:38:00,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:38:00,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:38:00,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:38:00,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:38:00,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-03-14 01:38:01,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a72176c/b2694a8f383044869e5bb6bd6abd3b99/FLAG057fd6d7a [2025-03-14 01:38:01,750 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:38:01,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-03-14 01:38:01,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a72176c/b2694a8f383044869e5bb6bd6abd3b99/FLAG057fd6d7a [2025-03-14 01:38:01,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a72176c/b2694a8f383044869e5bb6bd6abd3b99 [2025-03-14 01:38:01,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:38:01,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:38:01,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:38:01,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:38:02,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:38:02,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:38:01" (1/1) ... [2025-03-14 01:38:02,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcb33fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02, skipping insertion in model container [2025-03-14 01:38:02,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:38:01" (1/1) ... [2025-03-14 01:38:02,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:38:02,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:38:02,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:38:02,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:38:02,534 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:38:02,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02 WrapperNode [2025-03-14 01:38:02,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:38:02,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:38:02,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:38:02,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:38:02,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,584 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 243 [2025-03-14 01:38:02,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:38:02,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:38:02,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:38:02,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:38:02,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:38:02,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:38:02,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:38:02,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:38:02,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (1/1) ... [2025-03-14 01:38:02,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:38:02,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:02,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:38:02,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:38:02,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:38:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:38:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:38:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:38:02,668 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:38:02,790 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:38:02,791 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:38:03,168 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:38:03,169 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:38:03,169 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:38:03,193 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:38:03,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:38:03 BoogieIcfgContainer [2025-03-14 01:38:03,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:38:03,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:38:03,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:38:03,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:38:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:38:01" (1/3) ... [2025-03-14 01:38:03,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c82857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:38:03, skipping insertion in model container [2025-03-14 01:38:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:38:02" (2/3) ... [2025-03-14 01:38:03,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c82857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:38:03, skipping insertion in model container [2025-03-14 01:38:03,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:38:03" (3/3) ... [2025-03-14 01:38:03,203 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2025-03-14 01:38:03,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:38:03,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.i that has 2 procedures, 272 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-03-14 01:38:03,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:38:03,307 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:38:03,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 273 transitions, 550 flow [2025-03-14 01:38:03,430 INFO L124 PetriNetUnfolderBase]: 2/272 cut-off events. [2025-03-14 01:38:03,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:38:03,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 2/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 278 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2025-03-14 01:38:03,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 273 transitions, 550 flow [2025-03-14 01:38:03,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 272 transitions, 547 flow [2025-03-14 01:38:03,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:38:03,470 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c92c1a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:38:03,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-14 01:38:03,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:38:03,477 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-14 01:38:03,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:38:03,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:03,478 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] [2025-03-14 01:38:03,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1008874810, now seen corresponding path program 1 times [2025-03-14 01:38:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:03,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009399489] [2025-03-14 01:38:03,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:03,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:38:03,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:38:03,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:03,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:38:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009399489] [2025-03-14 01:38:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009399489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:04,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:04,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628864401] [2025-03-14 01:38:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:04,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:04,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:04,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 273 [2025-03-14 01:38:04,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:04,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:04,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 273 [2025-03-14 01:38:04,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:05,154 INFO L124 PetriNetUnfolderBase]: 1377/5015 cut-off events. [2025-03-14 01:38:05,155 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:38:05,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 5015 events. 1377/5015 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 37660 event pairs, 1344 based on Foata normal form. 36/4687 useless extension candidates. Maximal degree in co-relation 7712. Up to 2785 conditions per place. [2025-03-14 01:38:05,184 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 92 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2025-03-14 01:38:05,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 737 flow [2025-03-14 01:38:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions. [2025-03-14 01:38:05,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6978021978021978 [2025-03-14 01:38:05,203 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 547 flow. Second operand 6 states and 1143 transitions. [2025-03-14 01:38:05,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 737 flow [2025-03-14 01:38:05,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 270 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:38:05,215 INFO L231 Difference]: Finished difference. Result has 277 places, 270 transitions, 552 flow [2025-03-14 01:38:05,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=270} [2025-03-14 01:38:05,220 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 3 predicate places. [2025-03-14 01:38:05,220 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 270 transitions, 552 flow [2025-03-14 01:38:05,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:05,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:05,221 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] [2025-03-14 01:38:05,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:38:05,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash 427692015, now seen corresponding path program 1 times [2025-03-14 01:38:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665161421] [2025-03-14 01:38:05,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:05,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:38:05,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:38:05,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:05,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:38:05,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:05,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665161421] [2025-03-14 01:38:05,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665161421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:05,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:05,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196397193] [2025-03-14 01:38:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:05,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:05,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:05,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:05,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:05,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 273 [2025-03-14 01:38:05,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 270 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:05,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:05,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 273 [2025-03-14 01:38:05,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:06,659 INFO L124 PetriNetUnfolderBase]: 762/4094 cut-off events. [2025-03-14 01:38:06,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:38:06,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 4094 events. 762/4094 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 31550 event pairs, 460 based on Foata normal form. 0/3734 useless extension candidates. Maximal degree in co-relation 5631. Up to 1372 conditions per place. [2025-03-14 01:38:06,672 INFO L140 encePairwiseOnDemand]: 241/273 looper letters, 81 selfloop transitions, 90 changer transitions 0/370 dead transitions. [2025-03-14 01:38:06,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 370 transitions, 1094 flow [2025-03-14 01:38:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-14 01:38:06,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418803418803419 [2025-03-14 01:38:06,675 INFO L175 Difference]: Start difference. First operand has 277 places, 270 transitions, 552 flow. Second operand 6 states and 1379 transitions. [2025-03-14 01:38:06,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 370 transitions, 1094 flow [2025-03-14 01:38:06,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 370 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:38:06,686 INFO L231 Difference]: Finished difference. Result has 281 places, 353 transitions, 1118 flow [2025-03-14 01:38:06,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1118, PETRI_PLACES=281, PETRI_TRANSITIONS=353} [2025-03-14 01:38:06,688 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2025-03-14 01:38:06,688 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 353 transitions, 1118 flow [2025-03-14 01:38:06,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:06,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:06,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] [2025-03-14 01:38:06,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:38:06,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash -594871483, now seen corresponding path program 1 times [2025-03-14 01:38:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243516283] [2025-03-14 01:38:06,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:06,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:38:06,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:38:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:38:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243516283] [2025-03-14 01:38:06,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243516283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:06,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764791919] [2025-03-14 01:38:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:06,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:06,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:07,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273 [2025-03-14 01:38:07,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 353 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:07,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:07,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273 [2025-03-14 01:38:07,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:08,187 INFO L124 PetriNetUnfolderBase]: 2110/7422 cut-off events. [2025-03-14 01:38:08,187 INFO L125 PetriNetUnfolderBase]: For 1549/1554 co-relation queries the response was YES. [2025-03-14 01:38:08,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13852 conditions, 7422 events. 2110/7422 cut-off events. For 1549/1554 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 60055 event pairs, 1264 based on Foata normal form. 0/6804 useless extension candidates. Maximal degree in co-relation 13747. Up to 4041 conditions per place. [2025-03-14 01:38:08,221 INFO L140 encePairwiseOnDemand]: 232/273 looper letters, 187 selfloop transitions, 123 changer transitions 0/485 dead transitions. [2025-03-14 01:38:08,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 485 transitions, 2162 flow [2025-03-14 01:38:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-03-14 01:38:08,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881562881562881 [2025-03-14 01:38:08,226 INFO L175 Difference]: Start difference. First operand has 281 places, 353 transitions, 1118 flow. Second operand 6 states and 1291 transitions. [2025-03-14 01:38:08,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 485 transitions, 2162 flow [2025-03-14 01:38:08,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 485 transitions, 2162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:08,243 INFO L231 Difference]: Finished difference. Result has 290 places, 469 transitions, 2070 flow [2025-03-14 01:38:08,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2070, PETRI_PLACES=290, PETRI_TRANSITIONS=469} [2025-03-14 01:38:08,245 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 16 predicate places. [2025-03-14 01:38:08,245 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 469 transitions, 2070 flow [2025-03-14 01:38:08,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:08,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:08,246 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] [2025-03-14 01:38:08,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:38:08,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:08,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1460931657, now seen corresponding path program 1 times [2025-03-14 01:38:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:08,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495478342] [2025-03-14 01:38:08,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:08,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:38:08,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:38:08,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:08,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495478342] [2025-03-14 01:38:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495478342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:08,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339200322] [2025-03-14 01:38:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:08,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:08,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:08,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273 [2025-03-14 01:38:08,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 469 transitions, 2070 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:08,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:08,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273 [2025-03-14 01:38:08,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:09,910 INFO L124 PetriNetUnfolderBase]: 2411/8366 cut-off events. [2025-03-14 01:38:09,910 INFO L125 PetriNetUnfolderBase]: For 3695/3706 co-relation queries the response was YES. [2025-03-14 01:38:09,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17817 conditions, 8366 events. 2411/8366 cut-off events. For 3695/3706 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 68344 event pairs, 1292 based on Foata normal form. 0/7722 useless extension candidates. Maximal degree in co-relation 17698. Up to 4366 conditions per place. [2025-03-14 01:38:09,956 INFO L140 encePairwiseOnDemand]: 232/273 looper letters, 299 selfloop transitions, 123 changer transitions 0/601 dead transitions. [2025-03-14 01:38:09,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 601 transitions, 3562 flow [2025-03-14 01:38:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-03-14 01:38:09,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881562881562881 [2025-03-14 01:38:09,960 INFO L175 Difference]: Start difference. First operand has 290 places, 469 transitions, 2070 flow. Second operand 6 states and 1291 transitions. [2025-03-14 01:38:09,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 601 transitions, 3562 flow [2025-03-14 01:38:09,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 601 transitions, 3402 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:09,986 INFO L231 Difference]: Finished difference. Result has 299 places, 585 transitions, 3086 flow [2025-03-14 01:38:09,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3086, PETRI_PLACES=299, PETRI_TRANSITIONS=585} [2025-03-14 01:38:09,987 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 25 predicate places. [2025-03-14 01:38:09,988 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 585 transitions, 3086 flow [2025-03-14 01:38:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:09,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:09,989 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] [2025-03-14 01:38:09,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:38:09,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:09,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1229350872, now seen corresponding path program 1 times [2025-03-14 01:38:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683216271] [2025-03-14 01:38:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:10,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:38:10,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:38:10,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:10,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683216271] [2025-03-14 01:38:10,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683216271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:10,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:10,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782067669] [2025-03-14 01:38:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:10,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:10,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:10,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:10,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273 [2025-03-14 01:38:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 585 transitions, 3086 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273 [2025-03-14 01:38:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:11,919 INFO L124 PetriNetUnfolderBase]: 2735/9170 cut-off events. [2025-03-14 01:38:11,920 INFO L125 PetriNetUnfolderBase]: For 5379/5442 co-relation queries the response was YES. [2025-03-14 01:38:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21670 conditions, 9170 events. 2735/9170 cut-off events. For 5379/5442 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 75268 event pairs, 1246 based on Foata normal form. 0/8504 useless extension candidates. Maximal degree in co-relation 21538. Up to 4881 conditions per place. [2025-03-14 01:38:11,954 INFO L140 encePairwiseOnDemand]: 230/273 looper letters, 360 selfloop transitions, 180 changer transitions 0/768 dead transitions. [2025-03-14 01:38:11,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 768 transitions, 4754 flow [2025-03-14 01:38:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-03-14 01:38:11,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168498168498168 [2025-03-14 01:38:11,958 INFO L175 Difference]: Start difference. First operand has 299 places, 585 transitions, 3086 flow. Second operand 6 states and 1338 transitions. [2025-03-14 01:38:11,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 768 transitions, 4754 flow [2025-03-14 01:38:11,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 768 transitions, 4358 flow, removed 198 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:11,978 INFO L231 Difference]: Finished difference. Result has 309 places, 752 transitions, 4086 flow [2025-03-14 01:38:11,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4086, PETRI_PLACES=309, PETRI_TRANSITIONS=752} [2025-03-14 01:38:11,979 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 35 predicate places. [2025-03-14 01:38:11,979 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 752 transitions, 4086 flow [2025-03-14 01:38:11,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:11,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:11,980 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] [2025-03-14 01:38:11,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:38:11,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:11,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1642622548, now seen corresponding path program 1 times [2025-03-14 01:38:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:11,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213423485] [2025-03-14 01:38:11,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:11,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:38:12,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:38:12,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:12,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:12,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213423485] [2025-03-14 01:38:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213423485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:12,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:12,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:12,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408911401] [2025-03-14 01:38:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:12,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:12,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:12,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:12,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273 [2025-03-14 01:38:12,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 752 transitions, 4086 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:12,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:12,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273 [2025-03-14 01:38:12,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:14,215 INFO L124 PetriNetUnfolderBase]: 3196/10522 cut-off events. [2025-03-14 01:38:14,216 INFO L125 PetriNetUnfolderBase]: For 8642/8733 co-relation queries the response was YES. [2025-03-14 01:38:14,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27990 conditions, 10522 events. 3196/10522 cut-off events. For 8642/8733 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 87984 event pairs, 1284 based on Foata normal form. 0/9829 useless extension candidates. Maximal degree in co-relation 27853. Up to 5374 conditions per place. [2025-03-14 01:38:14,276 INFO L140 encePairwiseOnDemand]: 230/273 looper letters, 513 selfloop transitions, 180 changer transitions 0/935 dead transitions. [2025-03-14 01:38:14,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 935 transitions, 6354 flow [2025-03-14 01:38:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-03-14 01:38:14,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168498168498168 [2025-03-14 01:38:14,282 INFO L175 Difference]: Start difference. First operand has 309 places, 752 transitions, 4086 flow. Second operand 6 states and 1338 transitions. [2025-03-14 01:38:14,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 935 transitions, 6354 flow [2025-03-14 01:38:14,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 935 transitions, 6300 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:14,326 INFO L231 Difference]: Finished difference. Result has 319 places, 919 transitions, 5722 flow [2025-03-14 01:38:14,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=4032, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5722, PETRI_PLACES=319, PETRI_TRANSITIONS=919} [2025-03-14 01:38:14,328 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 45 predicate places. [2025-03-14 01:38:14,328 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 919 transitions, 5722 flow [2025-03-14 01:38:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:14,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:14,329 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] [2025-03-14 01:38:14,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:38:14,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 660601943, now seen corresponding path program 1 times [2025-03-14 01:38:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596985037] [2025-03-14 01:38:14,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:14,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:38:14,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:38:14,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:14,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:14,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596985037] [2025-03-14 01:38:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596985037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:14,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:14,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:38:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23153289] [2025-03-14 01:38:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:14,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:38:14,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:14,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:38:14,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:38:16,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-03-14 01:38:16,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 919 transitions, 5722 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:16,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:16,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-03-14 01:38:16,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:19,512 INFO L124 PetriNetUnfolderBase]: 4049/12582 cut-off events. [2025-03-14 01:38:19,512 INFO L125 PetriNetUnfolderBase]: For 15323/15418 co-relation queries the response was YES. [2025-03-14 01:38:19,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37825 conditions, 12582 events. 4049/12582 cut-off events. For 15323/15418 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 104982 event pairs, 787 based on Foata normal form. 37/11988 useless extension candidates. Maximal degree in co-relation 37676. Up to 4181 conditions per place. [2025-03-14 01:38:19,576 INFO L140 encePairwiseOnDemand]: 216/273 looper letters, 891 selfloop transitions, 228 changer transitions 0/1338 dead transitions. [2025-03-14 01:38:19,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1338 transitions, 10292 flow [2025-03-14 01:38:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:38:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:38:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3928 transitions. [2025-03-14 01:38:19,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6851561137275423 [2025-03-14 01:38:19,587 INFO L175 Difference]: Start difference. First operand has 319 places, 919 transitions, 5722 flow. Second operand 21 states and 3928 transitions. [2025-03-14 01:38:19,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1338 transitions, 10292 flow [2025-03-14 01:38:19,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 1338 transitions, 9932 flow, removed 180 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:19,665 INFO L231 Difference]: Finished difference. Result has 352 places, 976 transitions, 6629 flow [2025-03-14 01:38:19,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=5362, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6629, PETRI_PLACES=352, PETRI_TRANSITIONS=976} [2025-03-14 01:38:19,666 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 78 predicate places. [2025-03-14 01:38:19,666 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 976 transitions, 6629 flow [2025-03-14 01:38:19,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:19,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:19,668 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] [2025-03-14 01:38:19,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:38:19,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:19,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1892278917, now seen corresponding path program 2 times [2025-03-14 01:38:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:19,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310783799] [2025-03-14 01:38:19,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:38:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:19,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-14 01:38:19,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 91 of 93 statements. [2025-03-14 01:38:19,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:38:19,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310783799] [2025-03-14 01:38:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310783799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:38:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296099598] [2025-03-14 01:38:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:38:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:20,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:38:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:38:21,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-03-14 01:38:21,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 976 transitions, 6629 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:21,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:21,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-03-14 01:38:21,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:24,764 INFO L124 PetriNetUnfolderBase]: 5025/15548 cut-off events. [2025-03-14 01:38:24,765 INFO L125 PetriNetUnfolderBase]: For 25387/25693 co-relation queries the response was YES. [2025-03-14 01:38:24,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50536 conditions, 15548 events. 5025/15548 cut-off events. For 25387/25693 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 134977 event pairs, 810 based on Foata normal form. 48/14865 useless extension candidates. Maximal degree in co-relation 50373. Up to 2882 conditions per place. [2025-03-14 01:38:24,857 INFO L140 encePairwiseOnDemand]: 215/273 looper letters, 1304 selfloop transitions, 186 changer transitions 0/1709 dead transitions. [2025-03-14 01:38:24,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1709 transitions, 15193 flow [2025-03-14 01:38:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 01:38:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 01:38:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3946 transitions. [2025-03-14 01:38:24,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.657009657009657 [2025-03-14 01:38:24,863 INFO L175 Difference]: Start difference. First operand has 352 places, 976 transitions, 6629 flow. Second operand 22 states and 3946 transitions. [2025-03-14 01:38:24,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1709 transitions, 15193 flow [2025-03-14 01:38:24,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1709 transitions, 14912 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-14 01:38:24,975 INFO L231 Difference]: Finished difference. Result has 380 places, 1120 transitions, 8585 flow [2025-03-14 01:38:24,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6476, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8585, PETRI_PLACES=380, PETRI_TRANSITIONS=1120} [2025-03-14 01:38:24,976 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 106 predicate places. [2025-03-14 01:38:24,977 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 1120 transitions, 8585 flow [2025-03-14 01:38:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:24,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:24,978 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] [2025-03-14 01:38:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:38:24,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash 310000059, now seen corresponding path program 3 times [2025-03-14 01:38:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859989550] [2025-03-14 01:38:24,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:38:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:24,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-03-14 01:38:24,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 91 of 93 statements. [2025-03-14 01:38:24,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:38:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:25,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859989550] [2025-03-14 01:38:25,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859989550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:25,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:25,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:38:25,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610871958] [2025-03-14 01:38:25,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:25,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:38:25,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:25,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:38:25,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:38:26,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-03-14 01:38:26,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1120 transitions, 8585 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:26,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-03-14 01:38:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:30,909 INFO L124 PetriNetUnfolderBase]: 5061/15501 cut-off events. [2025-03-14 01:38:30,909 INFO L125 PetriNetUnfolderBase]: For 31726/31960 co-relation queries the response was YES. [2025-03-14 01:38:30,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53802 conditions, 15501 events. 5061/15501 cut-off events. For 31726/31960 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 134433 event pairs, 783 based on Foata normal form. 61/14869 useless extension candidates. Maximal degree in co-relation 53625. Up to 5168 conditions per place. [2025-03-14 01:38:31,033 INFO L140 encePairwiseOnDemand]: 216/273 looper letters, 959 selfloop transitions, 347 changer transitions 0/1525 dead transitions. [2025-03-14 01:38:31,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1525 transitions, 14271 flow [2025-03-14 01:38:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:38:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:38:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3237 transitions. [2025-03-14 01:38:31,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6974789915966386 [2025-03-14 01:38:31,038 INFO L175 Difference]: Start difference. First operand has 380 places, 1120 transitions, 8585 flow. Second operand 17 states and 3237 transitions. [2025-03-14 01:38:31,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1525 transitions, 14271 flow [2025-03-14 01:38:31,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 1525 transitions, 14091 flow, removed 59 selfloop flow, removed 2 redundant places. [2025-03-14 01:38:31,234 INFO L231 Difference]: Finished difference. Result has 404 places, 1192 transitions, 10699 flow [2025-03-14 01:38:31,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=8486, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10699, PETRI_PLACES=404, PETRI_TRANSITIONS=1192} [2025-03-14 01:38:31,235 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 130 predicate places. [2025-03-14 01:38:31,235 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 1192 transitions, 10699 flow [2025-03-14 01:38:31,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:31,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:31,236 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] [2025-03-14 01:38:31,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:38:31,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:31,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2108864681, now seen corresponding path program 4 times [2025-03-14 01:38:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056505148] [2025-03-14 01:38:31,237 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:38:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:31,249 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-14 01:38:31,255 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-03-14 01:38:31,255 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:38:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056505148] [2025-03-14 01:38:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056505148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386443001] [2025-03-14 01:38:31,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:38:31,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:31,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:31,770 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-03-14 01:38:31,771 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-03-14 01:38:31,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-14 01:38:31,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-03-14 01:38:31,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:38:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:31,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 01:38:31,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:31,977 INFO L378 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-03-14 01:38:32,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:38:32,006 INFO L378 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 11 treesize of output 11 [2025-03-14 01:38:32,027 INFO L378 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-03-14 01:38:32,034 INFO L378 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-03-14 01:38:32,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:38:32,047 INFO L378 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-03-14 01:38:32,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:38:32,063 INFO L378 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-03-14 01:38:32,109 INFO L378 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-03-14 01:38:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:32,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:38:32,140 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))) is different from false [2025-03-14 01:38:32,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))))) is different from false [2025-03-14 01:38:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386443001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:40,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:40,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2025-03-14 01:38:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745177654] [2025-03-14 01:38:40,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:40,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 01:38:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:40,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 01:38:40,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=282, Unknown=12, NotChecked=70, Total=420 [2025-03-14 01:38:40,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2025-03-14 01:38:40,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1192 transitions, 10699 flow. Second operand has 21 states, 21 states have (on average 100.19047619047619) internal successors, (2104), 21 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:40,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:40,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2025-03-14 01:38:40,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:48,304 INFO L124 PetriNetUnfolderBase]: 10816/27262 cut-off events. [2025-03-14 01:38:48,304 INFO L125 PetriNetUnfolderBase]: For 74858/74879 co-relation queries the response was YES. [2025-03-14 01:38:48,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100014 conditions, 27262 events. 10816/27262 cut-off events. For 74858/74879 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 234215 event pairs, 2699 based on Foata normal form. 37/25662 useless extension candidates. Maximal degree in co-relation 99815. Up to 6705 conditions per place. [2025-03-14 01:38:48,611 INFO L140 encePairwiseOnDemand]: 215/273 looper letters, 1750 selfloop transitions, 253 changer transitions 0/2102 dead transitions. [2025-03-14 01:38:48,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 2102 transitions, 21627 flow [2025-03-14 01:38:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:38:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:38:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2740 transitions. [2025-03-14 01:38:48,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47793476364904935 [2025-03-14 01:38:48,615 INFO L175 Difference]: Start difference. First operand has 404 places, 1192 transitions, 10699 flow. Second operand 21 states and 2740 transitions. [2025-03-14 01:38:48,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 2102 transitions, 21627 flow [2025-03-14 01:38:49,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 2102 transitions, 21241 flow, removed 93 selfloop flow, removed 7 redundant places. [2025-03-14 01:38:49,108 INFO L231 Difference]: Finished difference. Result has 431 places, 1287 transitions, 12771 flow [2025-03-14 01:38:49,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=10457, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12771, PETRI_PLACES=431, PETRI_TRANSITIONS=1287} [2025-03-14 01:38:49,110 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 157 predicate places. [2025-03-14 01:38:49,110 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 1287 transitions, 12771 flow [2025-03-14 01:38:49,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 100.19047619047619) internal successors, (2104), 21 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:49,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:49,111 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] [2025-03-14 01:38:49,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:38:49,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-14 01:38:49,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-14 01:38:49,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1211706741, now seen corresponding path program 5 times [2025-03-14 01:38:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798142273] [2025-03-14 01:38:49,313 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:38:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:49,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-14 01:38:49,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:38:49,338 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:38:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:49,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798142273] [2025-03-14 01:38:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798142273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:49,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709247185] [2025-03-14 01:38:49,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:38:49,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:49,825 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-03-14 01:38:49,827 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-03-14 01:38:49,922 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-14 01:38:49,954 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:38:49,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:38:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:49,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-14 01:38:49,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:49,966 INFO L378 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-03-14 01:38:50,065 INFO L378 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-03-14 01:38:50,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:38:50,103 INFO L378 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 11 treesize of output 11 [2025-03-14 01:38:50,130 INFO L378 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 21 treesize of output 20 [2025-03-14 01:38:50,174 INFO L378 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 30 treesize of output 32 [2025-03-14 01:38:50,211 INFO L378 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 39 treesize of output 44 [2025-03-14 01:38:50,444 INFO L378 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 50 treesize of output 47 [2025-03-14 01:38:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:50,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:38:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:38:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709247185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:53,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-14 01:38:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625386738] [2025-03-14 01:38:53,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:53,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-14 01:38:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:53,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-14 01:38:53,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2025-03-14 01:39:04,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:39:09,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:39:16,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:39:20,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]