./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:16:03,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:16:03,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:16:03,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:16:03,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:16:03,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:16:03,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:16:03,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:16:03,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:16:03,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:16:03,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:16:03,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:16:03,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:16:03,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:16:03,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:16:03,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:16:03,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:16:03,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:16:03,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:16:03,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:16:03,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:16:03,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:16:03,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:16:03,788 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-03-13 22:16:03,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:16:04,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:16:04,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:16:04,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:16:04,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:16:04,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-13 22:16:05,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c407efe90/00dc608a11ff4c1ebb5179e3f11e08a5/FLAG16fcaefca [2025-03-13 22:16:05,473 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:16:05,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-13 22:16:05,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c407efe90/00dc608a11ff4c1ebb5179e3f11e08a5/FLAG16fcaefca [2025-03-13 22:16:05,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c407efe90/00dc608a11ff4c1ebb5179e3f11e08a5 [2025-03-13 22:16:05,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:16:05,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:16:05,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:16:05,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:16:05,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:16:05,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f12aabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05, skipping insertion in model container [2025-03-13 22:16:05,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:16:05,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:16:05,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:16:05,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:16:05,941 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:16:05,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05 WrapperNode [2025-03-13 22:16:05,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:16:05,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:16:05,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:16:05,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:16:05,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,979 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 221 [2025-03-13 22:16:05,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:16:05,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:16:05,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:16:05,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:16:05,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:05,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:06,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:06,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:06,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:16:06,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:16:06,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:16:06,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:16:06,007 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (1/1) ... [2025-03-13 22:16:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:16:06,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:06,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:16:06,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:16:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:16:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:16:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:16:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:16:06,054 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:16:06,164 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:16:06,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:16:06,513 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:16:06,513 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:16:06,513 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:16:06,544 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:16:06,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:16:06 BoogieIcfgContainer [2025-03-13 22:16:06,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:16:06,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:16:06,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:16:06,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:16:06,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:16:05" (1/3) ... [2025-03-13 22:16:06,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e28a0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:16:06, skipping insertion in model container [2025-03-13 22:16:06,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:05" (2/3) ... [2025-03-13 22:16:06,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e28a0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:16:06, skipping insertion in model container [2025-03-13 22:16:06,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:16:06" (3/3) ... [2025-03-13 22:16:06,557 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-03-13 22:16:06,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:16:06,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 250 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-13 22:16:06,572 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:16:06,666 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:16:06,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 502 flow [2025-03-13 22:16:06,802 INFO L124 PetriNetUnfolderBase]: 0/248 cut-off events. [2025-03-13 22:16:06,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:06,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 248 events. 0/248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 103 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-13 22:16:06,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 502 flow [2025-03-13 22:16:06,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 248 transitions, 499 flow [2025-03-13 22:16:06,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:16:06,827 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;@58d737c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:16:06,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-13 22:16:06,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:16:06,847 INFO L124 PetriNetUnfolderBase]: 0/84 cut-off events. [2025-03-13 22:16:06,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:06,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:06,848 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] [2025-03-13 22:16:06,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1077091980, now seen corresponding path program 1 times [2025-03-13 22:16:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566693145] [2025-03-13 22:16:06,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:06,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-13 22:16:06,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-13 22:16:06,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:06,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:07,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:07,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566693145] [2025-03-13 22:16:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566693145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146112889] [2025-03-13 22:16:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:07,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:07,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:07,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:07,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-03-13 22:16:07,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:07,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:07,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-03-13 22:16:07,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:08,256 INFO L124 PetriNetUnfolderBase]: 220/1072 cut-off events. [2025-03-13 22:16:08,257 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:08,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1072 events. 220/1072 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5396 event pairs, 220 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-03-13 22:16:08,266 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2025-03-13 22:16:08,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 609 flow [2025-03-13 22:16:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-13 22:16:08,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-03-13 22:16:08,284 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 499 flow. Second operand 6 states and 1199 transitions. [2025-03-13 22:16:08,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 609 flow [2025-03-13 22:16:08,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 246 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:08,294 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 514 flow [2025-03-13 22:16:08,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=246} [2025-03-13 22:16:08,300 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 2 predicate places. [2025-03-13 22:16:08,300 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 514 flow [2025-03-13 22:16:08,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:08,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:08,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:16:08,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:08,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2076517541, now seen corresponding path program 1 times [2025-03-13 22:16:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97264367] [2025-03-13 22:16:08,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:08,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:16:08,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:16:08,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:08,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97264367] [2025-03-13 22:16:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97264367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032276354] [2025-03-13 22:16:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:08,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:08,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:08,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-03-13 22:16:08,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 246 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:08,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:08,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-03-13 22:16:08,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:09,125 INFO L124 PetriNetUnfolderBase]: 220/1070 cut-off events. [2025-03-13 22:16:09,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:09,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1070 events. 220/1070 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5353 event pairs, 220 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-03-13 22:16:09,130 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/244 dead transitions. [2025-03-13 22:16:09,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 244 transitions, 624 flow [2025-03-13 22:16:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-13 22:16:09,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-03-13 22:16:09,133 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 514 flow. Second operand 6 states and 1199 transitions. [2025-03-13 22:16:09,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 244 transitions, 624 flow [2025-03-13 22:16:09,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 244 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:09,137 INFO L231 Difference]: Finished difference. Result has 252 places, 244 transitions, 510 flow [2025-03-13 22:16:09,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=252, PETRI_TRANSITIONS=244} [2025-03-13 22:16:09,137 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 0 predicate places. [2025-03-13 22:16:09,138 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 244 transitions, 510 flow [2025-03-13 22:16:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:09,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:09,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:09,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:16:09,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:09,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -830488183, now seen corresponding path program 1 times [2025-03-13 22:16:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166584938] [2025-03-13 22:16:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:09,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:16:09,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:16:09,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:09,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166584938] [2025-03-13 22:16:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166584938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:09,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:16:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228949898] [2025-03-13 22:16:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:09,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:09,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:09,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:09,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 249 [2025-03-13 22:16:09,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 244 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:09,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:09,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 249 [2025-03-13 22:16:09,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:09,285 INFO L124 PetriNetUnfolderBase]: 16/379 cut-off events. [2025-03-13 22:16:09,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:09,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 379 events. 16/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 771 event pairs, 16 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-03-13 22:16:09,287 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 14 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-03-13 22:16:09,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 243 transitions, 540 flow [2025-03-13 22:16:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-13 22:16:09,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544846050870147 [2025-03-13 22:16:09,289 INFO L175 Difference]: Start difference. First operand has 252 places, 244 transitions, 510 flow. Second operand 3 states and 713 transitions. [2025-03-13 22:16:09,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 243 transitions, 540 flow [2025-03-13 22:16:09,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 243 transitions, 520 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:09,293 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 492 flow [2025-03-13 22:16:09,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2025-03-13 22:16:09,294 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -4 predicate places. [2025-03-13 22:16:09,294 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 492 flow [2025-03-13 22:16:09,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:09,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:09,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:09,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:16:09,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:09,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 515022388, now seen corresponding path program 1 times [2025-03-13 22:16:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322388522] [2025-03-13 22:16:09,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:09,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:16:09,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:16:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:09,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322388522] [2025-03-13 22:16:09,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322388522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:09,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:09,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:16:09,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435010233] [2025-03-13 22:16:09,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:09,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:09,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:09,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:09,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 249 [2025-03-13 22:16:09,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:09,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:09,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 249 [2025-03-13 22:16:09,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:09,421 INFO L124 PetriNetUnfolderBase]: 24/456 cut-off events. [2025-03-13 22:16:09,422 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 456 events. 24/456 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1215 event pairs, 24 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-03-13 22:16:09,424 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 15 selfloop transitions, 1 changer transitions 0/238 dead transitions. [2025-03-13 22:16:09,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 238 transitions, 514 flow [2025-03-13 22:16:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:16:09,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2025-03-13 22:16:09,426 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 492 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:16:09,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 238 transitions, 514 flow [2025-03-13 22:16:09,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 238 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:16:09,430 INFO L231 Difference]: Finished difference. Result has 243 places, 238 transitions, 480 flow [2025-03-13 22:16:09,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=243, PETRI_TRANSITIONS=238} [2025-03-13 22:16:09,432 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -9 predicate places. [2025-03-13 22:16:09,432 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 480 flow [2025-03-13 22:16:09,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:09,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:09,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:16:09,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash -815195224, now seen corresponding path program 1 times [2025-03-13 22:16:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401161180] [2025-03-13 22:16:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:09,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-13 22:16:09,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-13 22:16:09,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:09,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401161180] [2025-03-13 22:16:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401161180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564406421] [2025-03-13 22:16:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:09,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:09,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:10,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 249 [2025-03-13 22:16:10,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 238 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:10,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 249 [2025-03-13 22:16:10,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:10,275 INFO L124 PetriNetUnfolderBase]: 288/1209 cut-off events. [2025-03-13 22:16:10,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:10,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1209 events. 288/1209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6273 event pairs, 288 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-03-13 22:16:10,279 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 58 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-03-13 22:16:10,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 237 transitions, 604 flow [2025-03-13 22:16:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1174 transitions. [2025-03-13 22:16:10,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.785809906291834 [2025-03-13 22:16:10,281 INFO L175 Difference]: Start difference. First operand has 243 places, 238 transitions, 480 flow. Second operand 6 states and 1174 transitions. [2025-03-13 22:16:10,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 237 transitions, 604 flow [2025-03-13 22:16:10,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:10,287 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 487 flow [2025-03-13 22:16:10,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2025-03-13 22:16:10,288 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-03-13 22:16:10,288 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 487 flow [2025-03-13 22:16:10,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:10,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:10,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:10,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:16:10,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:10,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1573893837, now seen corresponding path program 1 times [2025-03-13 22:16:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806781684] [2025-03-13 22:16:10,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:10,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-13 22:16:10,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 22:16:10,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:10,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806781684] [2025-03-13 22:16:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806781684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003614212] [2025-03-13 22:16:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:10,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:10,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:10,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:10,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2025-03-13 22:16:10,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:10,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2025-03-13 22:16:10,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:11,180 INFO L124 PetriNetUnfolderBase]: 316/1535 cut-off events. [2025-03-13 22:16:11,180 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:11,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1535 events. 316/1535 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9237 event pairs, 36 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-03-13 22:16:11,186 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 99 selfloop transitions, 70 changer transitions 0/349 dead transitions. [2025-03-13 22:16:11,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 349 transitions, 1049 flow [2025-03-13 22:16:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-03-13 22:16:11,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8855421686746988 [2025-03-13 22:16:11,189 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 487 flow. Second operand 6 states and 1323 transitions. [2025-03-13 22:16:11,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 349 transitions, 1049 flow [2025-03-13 22:16:11,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 349 transitions, 1039 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:11,196 INFO L231 Difference]: Finished difference. Result has 250 places, 307 transitions, 955 flow [2025-03-13 22:16:11,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=250, PETRI_TRANSITIONS=307} [2025-03-13 22:16:11,198 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -2 predicate places. [2025-03-13 22:16:11,198 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 307 transitions, 955 flow [2025-03-13 22:16:11,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:11,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:11,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:11,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:16:11,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:11,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash -685165762, now seen corresponding path program 1 times [2025-03-13 22:16:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:11,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321260930] [2025-03-13 22:16:11,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:11,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:11,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-13 22:16:11,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-13 22:16:11,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:11,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321260930] [2025-03-13 22:16:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321260930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:11,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349340971] [2025-03-13 22:16:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:11,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:11,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:11,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2025-03-13 22:16:11,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 307 transitions, 955 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:11,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:11,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2025-03-13 22:16:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:12,081 INFO L124 PetriNetUnfolderBase]: 588/2306 cut-off events. [2025-03-13 22:16:12,081 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-03-13 22:16:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2306 events. 588/2306 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15134 event pairs, 222 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-03-13 22:16:12,091 INFO L140 encePairwiseOnDemand]: 234/249 looper letters, 106 selfloop transitions, 48 changer transitions 0/358 dead transitions. [2025-03-13 22:16:12,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 358 transitions, 1435 flow [2025-03-13 22:16:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1260 transitions. [2025-03-13 22:16:12,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433734939759037 [2025-03-13 22:16:12,094 INFO L175 Difference]: Start difference. First operand has 250 places, 307 transitions, 955 flow. Second operand 6 states and 1260 transitions. [2025-03-13 22:16:12,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 358 transitions, 1435 flow [2025-03-13 22:16:12,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 358 transitions, 1435 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:12,104 INFO L231 Difference]: Finished difference. Result has 260 places, 350 transitions, 1343 flow [2025-03-13 22:16:12,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=260, PETRI_TRANSITIONS=350} [2025-03-13 22:16:12,106 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 8 predicate places. [2025-03-13 22:16:12,106 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 350 transitions, 1343 flow [2025-03-13 22:16:12,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:12,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:12,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:16:12,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:12,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:12,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1537870320, now seen corresponding path program 1 times [2025-03-13 22:16:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:12,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829720299] [2025-03-13 22:16:12,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:12,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:12,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-13 22:16:12,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-13 22:16:12,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:12,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829720299] [2025-03-13 22:16:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829720299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996987422] [2025-03-13 22:16:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:12,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:12,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:12,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:12,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249 [2025-03-13 22:16:12,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 350 transitions, 1343 flow. Second operand has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:12,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:12,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249 [2025-03-13 22:16:12,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:12,994 INFO L124 PetriNetUnfolderBase]: 752/2855 cut-off events. [2025-03-13 22:16:12,994 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-03-13 22:16:12,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6632 conditions, 2855 events. 752/2855 cut-off events. For 1674/1740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 20053 event pairs, 86 based on Foata normal form. 0/2764 useless extension candidates. Maximal degree in co-relation 6506. Up to 1022 conditions per place. [2025-03-13 22:16:13,007 INFO L140 encePairwiseOnDemand]: 226/249 looper letters, 128 selfloop transitions, 136 changer transitions 4/490 dead transitions. [2025-03-13 22:16:13,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 490 transitions, 2635 flow [2025-03-13 22:16:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2025-03-13 22:16:13,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821954484605087 [2025-03-13 22:16:13,011 INFO L175 Difference]: Start difference. First operand has 260 places, 350 transitions, 1343 flow. Second operand 6 states and 1318 transitions. [2025-03-13 22:16:13,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 490 transitions, 2635 flow [2025-03-13 22:16:13,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 490 transitions, 2617 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:13,026 INFO L231 Difference]: Finished difference. Result has 270 places, 481 transitions, 2691 flow [2025-03-13 22:16:13,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2691, PETRI_PLACES=270, PETRI_TRANSITIONS=481} [2025-03-13 22:16:13,028 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 18 predicate places. [2025-03-13 22:16:13,029 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 481 transitions, 2691 flow [2025-03-13 22:16:13,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:13,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:13,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:13,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:16:13,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1769153453, now seen corresponding path program 1 times [2025-03-13 22:16:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:13,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916373760] [2025-03-13 22:16:13,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:13,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-13 22:16:13,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:16:13,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916373760] [2025-03-13 22:16:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916373760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:13,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:13,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 22:16:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480957320] [2025-03-13 22:16:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:13,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 22:16:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:13,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 22:16:13,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-13 22:16:14,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-13 22:16:14,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 481 transitions, 2691 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:14,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:14,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-13 22:16:14,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:15,760 INFO L124 PetriNetUnfolderBase]: 1151/4174 cut-off events. [2025-03-13 22:16:15,761 INFO L125 PetriNetUnfolderBase]: For 5352/5456 co-relation queries the response was YES. [2025-03-13 22:16:15,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11940 conditions, 4174 events. 1151/4174 cut-off events. For 5352/5456 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 32994 event pairs, 78 based on Foata normal form. 35/4115 useless extension candidates. Maximal degree in co-relation 11806. Up to 880 conditions per place. [2025-03-13 22:16:15,782 INFO L140 encePairwiseOnDemand]: 212/249 looper letters, 349 selfloop transitions, 159 changer transitions 4/705 dead transitions. [2025-03-13 22:16:15,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 705 transitions, 5131 flow [2025-03-13 22:16:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:16:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:16:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2777 transitions. [2025-03-13 22:16:15,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7966150315547906 [2025-03-13 22:16:15,787 INFO L175 Difference]: Start difference. First operand has 270 places, 481 transitions, 2691 flow. Second operand 14 states and 2777 transitions. [2025-03-13 22:16:15,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 705 transitions, 5131 flow [2025-03-13 22:16:15,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 705 transitions, 5059 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:15,811 INFO L231 Difference]: Finished difference. Result has 293 places, 544 transitions, 3964 flow [2025-03-13 22:16:15,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3964, PETRI_PLACES=293, PETRI_TRANSITIONS=544} [2025-03-13 22:16:15,812 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 41 predicate places. [2025-03-13 22:16:15,812 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 544 transitions, 3964 flow [2025-03-13 22:16:15,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:15,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:15,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:16:15,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:15,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 442162861, now seen corresponding path program 2 times [2025-03-13 22:16:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695511356] [2025-03-13 22:16:15,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:15,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 1 equivalence classes. [2025-03-13 22:16:15,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:16:15,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:16:15,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:16,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:16,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695511356] [2025-03-13 22:16:16,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695511356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:16,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 22:16:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671911107] [2025-03-13 22:16:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 22:16:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:16,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 22:16:16,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-13 22:16:17,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-13 22:16:17,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 544 transitions, 3964 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:17,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:17,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-13 22:16:17,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:18,303 INFO L124 PetriNetUnfolderBase]: 1253/4625 cut-off events. [2025-03-13 22:16:18,303 INFO L125 PetriNetUnfolderBase]: For 9619/9723 co-relation queries the response was YES. [2025-03-13 22:16:18,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14585 conditions, 4625 events. 1253/4625 cut-off events. For 9619/9723 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 37286 event pairs, 125 based on Foata normal form. 37/4546 useless extension candidates. Maximal degree in co-relation 14437. Up to 891 conditions per place. [2025-03-13 22:16:18,325 INFO L140 encePairwiseOnDemand]: 228/249 looper letters, 440 selfloop transitions, 103 changer transitions 0/736 dead transitions. [2025-03-13 22:16:18,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 736 transitions, 6508 flow [2025-03-13 22:16:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 22:16:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 22:16:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3604 transitions. [2025-03-13 22:16:18,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7617839780173324 [2025-03-13 22:16:18,331 INFO L175 Difference]: Start difference. First operand has 293 places, 544 transitions, 3964 flow. Second operand 19 states and 3604 transitions. [2025-03-13 22:16:18,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 736 transitions, 6508 flow [2025-03-13 22:16:18,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 736 transitions, 6503 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:16:18,362 INFO L231 Difference]: Finished difference. Result has 317 places, 599 transitions, 4779 flow [2025-03-13 22:16:18,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3959, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4779, PETRI_PLACES=317, PETRI_TRANSITIONS=599} [2025-03-13 22:16:18,363 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 65 predicate places. [2025-03-13 22:16:18,363 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 599 transitions, 4779 flow [2025-03-13 22:16:18,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:18,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:18,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:18,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:16:18,364 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:18,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1823547693, now seen corresponding path program 3 times [2025-03-13 22:16:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24406905] [2025-03-13 22:16:18,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:18,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 1 equivalence classes. [2025-03-13 22:16:18,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:16:18,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:16:18,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24406905] [2025-03-13 22:16:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24406905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 22:16:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99455554] [2025-03-13 22:16:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 22:16:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:18,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 22:16:18,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-13 22:16:19,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-13 22:16:19,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 599 transitions, 4779 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:19,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:19,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-13 22:16:19,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:21,164 INFO L124 PetriNetUnfolderBase]: 1786/6454 cut-off events. [2025-03-13 22:16:21,164 INFO L125 PetriNetUnfolderBase]: For 17728/17926 co-relation queries the response was YES. [2025-03-13 22:16:21,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21745 conditions, 6454 events. 1786/6454 cut-off events. For 17728/17926 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 57834 event pairs, 146 based on Foata normal form. 52/6330 useless extension candidates. Maximal degree in co-relation 21587. Up to 1298 conditions per place. [2025-03-13 22:16:21,198 INFO L140 encePairwiseOnDemand]: 216/249 looper letters, 450 selfloop transitions, 226 changer transitions 3/872 dead transitions. [2025-03-13 22:16:21,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 872 transitions, 8587 flow [2025-03-13 22:16:21,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-13 22:16:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-13 22:16:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3860 transitions. [2025-03-13 22:16:21,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7751004016064257 [2025-03-13 22:16:21,204 INFO L175 Difference]: Start difference. First operand has 317 places, 599 transitions, 4779 flow. Second operand 20 states and 3860 transitions. [2025-03-13 22:16:21,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 872 transitions, 8587 flow [2025-03-13 22:16:21,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 872 transitions, 8551 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:21,262 INFO L231 Difference]: Finished difference. Result has 342 places, 693 transitions, 6986 flow [2025-03-13 22:16:21,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=4753, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6986, PETRI_PLACES=342, PETRI_TRANSITIONS=693} [2025-03-13 22:16:21,264 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 90 predicate places. [2025-03-13 22:16:21,264 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 693 transitions, 6986 flow [2025-03-13 22:16:21,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:21,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:21,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:21,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:16:21,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:21,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1956249879, now seen corresponding path program 4 times [2025-03-13 22:16:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:21,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010194761] [2025-03-13 22:16:21,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:21,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:21,284 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-03-13 22:16:21,292 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 148 of 164 statements. [2025-03-13 22:16:21,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 22:16:21,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010194761] [2025-03-13 22:16:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010194761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:21,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 22:16:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596841111] [2025-03-13 22:16:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 22:16:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:21,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 22:16:21,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-13 22:16:22,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-13 22:16:22,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 693 transitions, 6986 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:22,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:22,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-13 22:16:22,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:24,162 INFO L124 PetriNetUnfolderBase]: 2501/8900 cut-off events. [2025-03-13 22:16:24,162 INFO L125 PetriNetUnfolderBase]: For 36110/36440 co-relation queries the response was YES. [2025-03-13 22:16:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32599 conditions, 8900 events. 2501/8900 cut-off events. For 36110/36440 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 87216 event pairs, 163 based on Foata normal form. 107/8771 useless extension candidates. Maximal degree in co-relation 32429. Up to 1807 conditions per place. [2025-03-13 22:16:24,219 INFO L140 encePairwiseOnDemand]: 220/249 looper letters, 510 selfloop transitions, 301 changer transitions 0/1004 dead transitions. [2025-03-13 22:16:24,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1004 transitions, 12268 flow [2025-03-13 22:16:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 22:16:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 22:16:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3629 transitions. [2025-03-13 22:16:24,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670682730923695 [2025-03-13 22:16:24,224 INFO L175 Difference]: Start difference. First operand has 342 places, 693 transitions, 6986 flow. Second operand 19 states and 3629 transitions. [2025-03-13 22:16:24,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1004 transitions, 12268 flow [2025-03-13 22:16:24,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1004 transitions, 12226 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-13 22:16:24,341 INFO L231 Difference]: Finished difference. Result has 362 places, 806 transitions, 10052 flow [2025-03-13 22:16:24,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=6944, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10052, PETRI_PLACES=362, PETRI_TRANSITIONS=806} [2025-03-13 22:16:24,343 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 110 predicate places. [2025-03-13 22:16:24,343 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 806 transitions, 10052 flow [2025-03-13 22:16:24,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:24,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:24,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:24,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:16:24,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:16:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1135270513, now seen corresponding path program 5 times [2025-03-13 22:16:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655023556] [2025-03-13 22:16:24,346 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:24,364 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-13 22:16:24,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:16:24,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:16:24,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655023556] [2025-03-13 22:16:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655023556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958474373] [2025-03-13 22:16:24,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:24,827 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-13 22:16:24,828 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-13 22:16:24,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-13 22:16:24,987 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:16:24,987 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:16:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:24,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 22:16:24,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:25,139 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 13 treesize of output 9 [2025-03-13 22:16:25,165 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 23 treesize of output 22 [2025-03-13 22:16:25,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:25,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-13 22:16:25,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:25,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-13 22:16:25,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 22:16:25,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 22:16:25,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 22:16:25,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 22:16:25,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:25,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2025-03-13 22:16:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:25,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:16:27,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:16:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:16:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958474373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:16:27,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:16:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 22:16:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789803454] [2025-03-13 22:16:27,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:16:27,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 22:16:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:27,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 22:16:27,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 22:16:29,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:16:32,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:16:45,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:16:56,496 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-13 22:17:04,058 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-13 22:17:08,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:17:18,411 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-13 22:17:19,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:17:29,457 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-13 22:17:34,591 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-13 22:17:38,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]