./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_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-?-735b3cc-m [2025-03-14 01:35:43,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:43,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:35:43,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:43,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:43,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:43,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:43,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:43,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:43,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:43,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:43,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:43,909 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:43,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:43,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:43,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:43,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:43,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:43,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:43,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:43,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:43,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:43,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:43,912 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-14 01:35:44,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:44,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:44,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:44,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:44,147 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:44,148 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-14 01:35:45,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d59180/f8d743b3fe4b498498c64ea09769a4b5/FLAG9618463c6 [2025-03-14 01:35:45,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:45,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-03-14 01:35:45,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d59180/f8d743b3fe4b498498c64ea09769a4b5/FLAG9618463c6 [2025-03-14 01:35:45,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d59180/f8d743b3fe4b498498c64ea09769a4b5 [2025-03-14 01:35:45,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:45,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:45,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:45,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:45,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:45,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:45" (1/1) ... [2025-03-14 01:35:45,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e06f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:45, skipping insertion in model container [2025-03-14 01:35:45,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:45" (1/1) ... [2025-03-14 01:35:45,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:46,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:46,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:46,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:46,208 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:46,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46 WrapperNode [2025-03-14 01:35:46,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:46,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:46,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:46,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:46,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,259 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 221 [2025-03-14 01:35:46,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:46,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:46,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:46,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:46,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:46,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:46,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:46,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:46,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (1/1) ... [2025-03-14 01:35:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:46,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:46,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:35:46,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:35:46,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:35:46,341 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:46,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:35:46,342 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:46,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:46,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:46,343 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:35:46,447 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:46,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:46,808 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:46,810 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:46,810 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:46,845 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:46,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:46 BoogieIcfgContainer [2025-03-14 01:35:46,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:46,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:46,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:46,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:46,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:45" (1/3) ... [2025-03-14 01:35:46,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa2b2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:46, skipping insertion in model container [2025-03-14 01:35:46,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:46" (2/3) ... [2025-03-14 01:35:46,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa2b2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:46, skipping insertion in model container [2025-03-14 01:35:46,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:46" (3/3) ... [2025-03-14 01:35:46,855 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-03-14 01:35:46,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:46,865 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-14 01:35:46,865 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:46,929 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:35:46,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 502 flow [2025-03-14 01:35:47,033 INFO L124 PetriNetUnfolderBase]: 0/248 cut-off events. [2025-03-14 01:35:47,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:47,038 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-14 01:35:47,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 502 flow [2025-03-14 01:35:47,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 248 transitions, 499 flow [2025-03-14 01:35:47,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:47,063 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;@1302b049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:47,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-14 01:35:47,078 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:47,078 INFO L124 PetriNetUnfolderBase]: 0/84 cut-off events. [2025-03-14 01:35:47,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:47,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:47,080 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-14 01:35:47,081 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-14 01:35:47,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1077091980, now seen corresponding path program 1 times [2025-03-14 01:35:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:47,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439282681] [2025-03-14 01:35:47,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:47,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-14 01:35:47,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-14 01:35:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:47,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-14 01:35:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439282681] [2025-03-14 01:35:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439282681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:47,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014916188] [2025-03-14 01:35:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:47,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:47,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:47,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:48,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-03-14 01:35:48,188 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-14 01:35:48,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:48,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-03-14 01:35:48,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:48,475 INFO L124 PetriNetUnfolderBase]: 220/1072 cut-off events. [2025-03-14 01:35:48,475 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:48,480 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-14 01:35:48,485 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2025-03-14 01:35:48,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 609 flow [2025-03-14 01:35:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-14 01:35:48,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-03-14 01:35:48,504 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 499 flow. Second operand 6 states and 1199 transitions. [2025-03-14 01:35:48,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 609 flow [2025-03-14 01:35:48,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 246 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:48,515 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 514 flow [2025-03-14 01:35:48,517 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-14 01:35:48,521 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 2 predicate places. [2025-03-14 01:35:48,522 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 514 flow [2025-03-14 01:35:48,523 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-14 01:35:48,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:48,523 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-14 01:35:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:35:48,524 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-14 01:35:48,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2076517541, now seen corresponding path program 1 times [2025-03-14 01:35:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255572023] [2025-03-14 01:35:48,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:48,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:35:48,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:35:48,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:48,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:48,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255572023] [2025-03-14 01:35:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255572023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:48,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:48,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:48,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836412803] [2025-03-14 01:35:48,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:48,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:48,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:48,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:49,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-03-14 01:35:49,212 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-14 01:35:49,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:49,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-03-14 01:35:49,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:49,399 INFO L124 PetriNetUnfolderBase]: 220/1070 cut-off events. [2025-03-14 01:35:49,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:49,404 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-14 01:35:49,409 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/244 dead transitions. [2025-03-14 01:35:49,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 244 transitions, 624 flow [2025-03-14 01:35:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-14 01:35:49,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-03-14 01:35:49,413 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 514 flow. Second operand 6 states and 1199 transitions. [2025-03-14 01:35:49,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 244 transitions, 624 flow [2025-03-14 01:35:49,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 244 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:35:49,420 INFO L231 Difference]: Finished difference. Result has 252 places, 244 transitions, 510 flow [2025-03-14 01:35:49,421 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-14 01:35:49,421 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 0 predicate places. [2025-03-14 01:35:49,421 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 244 transitions, 510 flow [2025-03-14 01:35:49,422 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-14 01:35:49,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:49,422 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-14 01:35:49,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:35:49,422 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-14 01:35:49,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash -830488183, now seen corresponding path program 1 times [2025-03-14 01:35:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:49,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075311821] [2025-03-14 01:35:49,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-14 01:35:49,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-14 01:35:49,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:49,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:49,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:49,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075311821] [2025-03-14 01:35:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075311821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:49,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566328818] [2025-03-14 01:35:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:49,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:49,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:49,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 249 [2025-03-14 01:35:49,517 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-14 01:35:49,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:49,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 249 [2025-03-14 01:35:49,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:49,555 INFO L124 PetriNetUnfolderBase]: 16/379 cut-off events. [2025-03-14 01:35:49,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:49,556 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-14 01:35:49,557 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 14 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-03-14 01:35:49,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 243 transitions, 540 flow [2025-03-14 01:35:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-14 01:35:49,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544846050870147 [2025-03-14 01:35:49,561 INFO L175 Difference]: Start difference. First operand has 252 places, 244 transitions, 510 flow. Second operand 3 states and 713 transitions. [2025-03-14 01:35:49,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 243 transitions, 540 flow [2025-03-14 01:35:49,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 243 transitions, 520 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:35:49,564 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 492 flow [2025-03-14 01:35:49,564 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-14 01:35:49,565 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -4 predicate places. [2025-03-14 01:35:49,565 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 492 flow [2025-03-14 01:35:49,565 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-14 01:35:49,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:49,566 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-14 01:35:49,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:35:49,566 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-14 01:35:49,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash 515022388, now seen corresponding path program 1 times [2025-03-14 01:35:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391139772] [2025-03-14 01:35:49,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:49,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:35:49,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:35:49,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:49,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391139772] [2025-03-14 01:35:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391139772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:49,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:49,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908843798] [2025-03-14 01:35:49,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:49,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:49,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:49,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 249 [2025-03-14 01:35:49,627 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-14 01:35:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 249 [2025-03-14 01:35:49,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:49,674 INFO L124 PetriNetUnfolderBase]: 24/456 cut-off events. [2025-03-14 01:35:49,674 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:49,675 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-14 01:35:49,676 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 15 selfloop transitions, 1 changer transitions 0/238 dead transitions. [2025-03-14 01:35:49,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 238 transitions, 514 flow [2025-03-14 01:35:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-14 01:35:49,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2025-03-14 01:35:49,678 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 492 flow. Second operand 3 states and 705 transitions. [2025-03-14 01:35:49,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 238 transitions, 514 flow [2025-03-14 01:35:49,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 238 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:49,681 INFO L231 Difference]: Finished difference. Result has 243 places, 238 transitions, 480 flow [2025-03-14 01:35:49,681 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-14 01:35:49,682 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -9 predicate places. [2025-03-14 01:35:49,682 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 480 flow [2025-03-14 01:35:49,682 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-14 01:35:49,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:49,683 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-14 01:35:49,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:35:49,683 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-14 01:35:49,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash -815195224, now seen corresponding path program 1 times [2025-03-14 01:35:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:49,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845481955] [2025-03-14 01:35:49,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:49,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-14 01:35:49,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-14 01:35:49,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:49,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845481955] [2025-03-14 01:35:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845481955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996184933] [2025-03-14 01:35:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:50,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:50,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:50,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:50,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 249 [2025-03-14 01:35:50,348 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-14 01:35:50,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:50,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 249 [2025-03-14 01:35:50,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:50,529 INFO L124 PetriNetUnfolderBase]: 288/1209 cut-off events. [2025-03-14 01:35:50,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:50,532 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-14 01:35:50,535 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 58 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-03-14 01:35:50,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 237 transitions, 604 flow [2025-03-14 01:35:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1174 transitions. [2025-03-14 01:35:50,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.785809906291834 [2025-03-14 01:35:50,538 INFO L175 Difference]: Start difference. First operand has 243 places, 238 transitions, 480 flow. Second operand 6 states and 1174 transitions. [2025-03-14 01:35:50,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 237 transitions, 604 flow [2025-03-14 01:35:50,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:50,543 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 487 flow [2025-03-14 01:35:50,544 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-14 01:35:50,545 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-03-14 01:35:50,545 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 487 flow [2025-03-14 01:35:50,546 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-14 01:35:50,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:50,546 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-14 01:35:50,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:35:50,546 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-14 01:35:50,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1573893837, now seen corresponding path program 1 times [2025-03-14 01:35:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:50,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582720847] [2025-03-14 01:35:50,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:35:50,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:35:50,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:50,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582720847] [2025-03-14 01:35:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582720847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536544376] [2025-03-14 01:35:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:50,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:50,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:51,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2025-03-14 01:35:51,212 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-14 01:35:51,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:51,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2025-03-14 01:35:51,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:51,477 INFO L124 PetriNetUnfolderBase]: 316/1535 cut-off events. [2025-03-14 01:35:51,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:51,479 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-14 01:35:51,483 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 99 selfloop transitions, 70 changer transitions 0/349 dead transitions. [2025-03-14 01:35:51,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 349 transitions, 1049 flow [2025-03-14 01:35:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-03-14 01:35:51,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8855421686746988 [2025-03-14 01:35:51,488 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 487 flow. Second operand 6 states and 1323 transitions. [2025-03-14 01:35:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 349 transitions, 1049 flow [2025-03-14 01:35:51,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 349 transitions, 1039 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:35:51,496 INFO L231 Difference]: Finished difference. Result has 250 places, 307 transitions, 955 flow [2025-03-14 01:35:51,497 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-14 01:35:51,499 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -2 predicate places. [2025-03-14 01:35:51,499 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 307 transitions, 955 flow [2025-03-14 01:35:51,499 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-14 01:35:51,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:51,500 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-14 01:35:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:35:51,500 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-14 01:35:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash -685165762, now seen corresponding path program 1 times [2025-03-14 01:35:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429122824] [2025-03-14 01:35:51,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-14 01:35:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-14 01:35:51,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:51,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:51,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429122824] [2025-03-14 01:35:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429122824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:51,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:51,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477954619] [2025-03-14 01:35:51,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:51,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:51,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:51,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:52,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2025-03-14 01:35:52,096 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-14 01:35:52,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:52,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2025-03-14 01:35:52,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:52,339 INFO L124 PetriNetUnfolderBase]: 588/2306 cut-off events. [2025-03-14 01:35:52,339 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-03-14 01:35:52,369 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-14 01:35:52,375 INFO L140 encePairwiseOnDemand]: 234/249 looper letters, 106 selfloop transitions, 48 changer transitions 0/358 dead transitions. [2025-03-14 01:35:52,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 358 transitions, 1435 flow [2025-03-14 01:35:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1260 transitions. [2025-03-14 01:35:52,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433734939759037 [2025-03-14 01:35:52,377 INFO L175 Difference]: Start difference. First operand has 250 places, 307 transitions, 955 flow. Second operand 6 states and 1260 transitions. [2025-03-14 01:35:52,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 358 transitions, 1435 flow [2025-03-14 01:35:52,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 358 transitions, 1435 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:52,387 INFO L231 Difference]: Finished difference. Result has 260 places, 350 transitions, 1343 flow [2025-03-14 01:35:52,387 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-14 01:35:52,388 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 8 predicate places. [2025-03-14 01:35:52,388 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 350 transitions, 1343 flow [2025-03-14 01:35:52,389 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-14 01:35:52,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:52,389 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-14 01:35:52,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:35:52,389 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-14 01:35:52,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1537870320, now seen corresponding path program 1 times [2025-03-14 01:35:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:52,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495859731] [2025-03-14 01:35:52,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:52,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-14 01:35:52,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-14 01:35:52,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:52,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495859731] [2025-03-14 01:35:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495859731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629282750] [2025-03-14 01:35:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:52,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:52,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249 [2025-03-14 01:35:52,933 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-14 01:35:52,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:52,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249 [2025-03-14 01:35:52,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:53,315 INFO L124 PetriNetUnfolderBase]: 752/2855 cut-off events. [2025-03-14 01:35:53,316 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-03-14 01:35:53,323 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-14 01:35:53,335 INFO L140 encePairwiseOnDemand]: 226/249 looper letters, 128 selfloop transitions, 136 changer transitions 4/490 dead transitions. [2025-03-14 01:35:53,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 490 transitions, 2635 flow [2025-03-14 01:35:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2025-03-14 01:35:53,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821954484605087 [2025-03-14 01:35:53,341 INFO L175 Difference]: Start difference. First operand has 260 places, 350 transitions, 1343 flow. Second operand 6 states and 1318 transitions. [2025-03-14 01:35:53,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 490 transitions, 2635 flow [2025-03-14 01:35:53,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 490 transitions, 2617 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:53,358 INFO L231 Difference]: Finished difference. Result has 270 places, 481 transitions, 2691 flow [2025-03-14 01:35:53,359 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-14 01:35:53,359 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 18 predicate places. [2025-03-14 01:35:53,359 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 481 transitions, 2691 flow [2025-03-14 01:35:53,362 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-14 01:35:53,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:53,362 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-14 01:35:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:35:53,362 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-14 01:35:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1769153453, now seen corresponding path program 1 times [2025-03-14 01:35:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117429513] [2025-03-14 01:35:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:53,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-14 01:35:53,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:35:53,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:53,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117429513] [2025-03-14 01:35:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117429513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:35:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24048792] [2025-03-14 01:35:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:54,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:35:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:54,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:35:54,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:35:54,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-14 01:35:54,896 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-14 01:35:54,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:54,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-14 01:35:54,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:56,013 INFO L124 PetriNetUnfolderBase]: 1151/4174 cut-off events. [2025-03-14 01:35:56,013 INFO L125 PetriNetUnfolderBase]: For 5352/5456 co-relation queries the response was YES. [2025-03-14 01:35:56,022 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-14 01:35:56,036 INFO L140 encePairwiseOnDemand]: 212/249 looper letters, 349 selfloop transitions, 159 changer transitions 4/705 dead transitions. [2025-03-14 01:35:56,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 705 transitions, 5131 flow [2025-03-14 01:35:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:35:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:35:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2777 transitions. [2025-03-14 01:35:56,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7966150315547906 [2025-03-14 01:35:56,040 INFO L175 Difference]: Start difference. First operand has 270 places, 481 transitions, 2691 flow. Second operand 14 states and 2777 transitions. [2025-03-14 01:35:56,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 705 transitions, 5131 flow [2025-03-14 01:35:56,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 705 transitions, 5059 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:56,068 INFO L231 Difference]: Finished difference. Result has 293 places, 544 transitions, 3964 flow [2025-03-14 01:35:56,069 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-14 01:35:56,070 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 41 predicate places. [2025-03-14 01:35:56,070 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 544 transitions, 3964 flow [2025-03-14 01:35:56,071 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-14 01:35:56,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:56,071 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-14 01:35:56,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:35:56,072 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-14 01:35:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 442162861, now seen corresponding path program 2 times [2025-03-14 01:35:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523123482] [2025-03-14 01:35:56,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:56,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 1 equivalence classes. [2025-03-14 01:35:56,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:35:56,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:56,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523123482] [2025-03-14 01:35:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523123482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:35:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452398382] [2025-03-14 01:35:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:35:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:56,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:35:56,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:35:57,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-14 01:35:57,469 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-14 01:35:57,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:57,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-14 01:35:57,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:58,510 INFO L124 PetriNetUnfolderBase]: 1253/4625 cut-off events. [2025-03-14 01:35:58,510 INFO L125 PetriNetUnfolderBase]: For 9619/9723 co-relation queries the response was YES. [2025-03-14 01:35:58,525 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-14 01:35:58,541 INFO L140 encePairwiseOnDemand]: 228/249 looper letters, 440 selfloop transitions, 103 changer transitions 0/736 dead transitions. [2025-03-14 01:35:58,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 736 transitions, 6508 flow [2025-03-14 01:35:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:35:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:35:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3604 transitions. [2025-03-14 01:35:58,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7617839780173324 [2025-03-14 01:35:58,547 INFO L175 Difference]: Start difference. First operand has 293 places, 544 transitions, 3964 flow. Second operand 19 states and 3604 transitions. [2025-03-14 01:35:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 736 transitions, 6508 flow [2025-03-14 01:35:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 736 transitions, 6503 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:35:58,581 INFO L231 Difference]: Finished difference. Result has 317 places, 599 transitions, 4779 flow [2025-03-14 01:35:58,582 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-14 01:35:58,582 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 65 predicate places. [2025-03-14 01:35:58,582 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 599 transitions, 4779 flow [2025-03-14 01:35:58,583 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-14 01:35:58,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:58,583 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-14 01:35:58,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:35:58,583 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-14 01:35:58,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1823547693, now seen corresponding path program 3 times [2025-03-14 01:35:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10738380] [2025-03-14 01:35:58,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:35:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:58,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 1 equivalence classes. [2025-03-14 01:35:58,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:35:58,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:35:58,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10738380] [2025-03-14 01:35:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10738380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:59,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:35:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562342701] [2025-03-14 01:35:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:35:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:59,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:35:59,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:35:59,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-14 01:35:59,715 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-14 01:35:59,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:59,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-14 01:35:59,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:01,106 INFO L124 PetriNetUnfolderBase]: 1786/6454 cut-off events. [2025-03-14 01:36:01,106 INFO L125 PetriNetUnfolderBase]: For 17728/17926 co-relation queries the response was YES. [2025-03-14 01:36:01,124 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-14 01:36:01,141 INFO L140 encePairwiseOnDemand]: 216/249 looper letters, 450 selfloop transitions, 226 changer transitions 3/872 dead transitions. [2025-03-14 01:36:01,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 872 transitions, 8587 flow [2025-03-14 01:36:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 01:36:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 01:36:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3860 transitions. [2025-03-14 01:36:01,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7751004016064257 [2025-03-14 01:36:01,148 INFO L175 Difference]: Start difference. First operand has 317 places, 599 transitions, 4779 flow. Second operand 20 states and 3860 transitions. [2025-03-14 01:36:01,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 872 transitions, 8587 flow [2025-03-14 01:36:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 872 transitions, 8551 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:01,214 INFO L231 Difference]: Finished difference. Result has 342 places, 693 transitions, 6986 flow [2025-03-14 01:36:01,214 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-14 01:36:01,215 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 90 predicate places. [2025-03-14 01:36:01,215 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 693 transitions, 6986 flow [2025-03-14 01:36:01,216 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-14 01:36:01,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:01,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:01,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:36:01,216 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-14 01:36:01,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1956249879, now seen corresponding path program 4 times [2025-03-14 01:36:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:01,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974346323] [2025-03-14 01:36:01,217 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:36:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:01,235 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-03-14 01:36:01,242 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 148 of 164 statements. [2025-03-14 01:36:01,242 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:36:01,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974346323] [2025-03-14 01:36:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974346323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77897096] [2025-03-14 01:36:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:01,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:01,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:01,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:02,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-14 01:36:02,481 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-14 01:36:02,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:02,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-14 01:36:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:04,210 INFO L124 PetriNetUnfolderBase]: 2501/8900 cut-off events. [2025-03-14 01:36:04,210 INFO L125 PetriNetUnfolderBase]: For 36110/36440 co-relation queries the response was YES. [2025-03-14 01:36:04,239 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-14 01:36:04,264 INFO L140 encePairwiseOnDemand]: 220/249 looper letters, 510 selfloop transitions, 301 changer transitions 0/1004 dead transitions. [2025-03-14 01:36:04,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1004 transitions, 12268 flow [2025-03-14 01:36:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:36:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:36:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3629 transitions. [2025-03-14 01:36:04,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670682730923695 [2025-03-14 01:36:04,269 INFO L175 Difference]: Start difference. First operand has 342 places, 693 transitions, 6986 flow. Second operand 19 states and 3629 transitions. [2025-03-14 01:36:04,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1004 transitions, 12268 flow [2025-03-14 01:36:04,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1004 transitions, 12226 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-14 01:36:04,404 INFO L231 Difference]: Finished difference. Result has 362 places, 806 transitions, 10052 flow [2025-03-14 01:36:04,405 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-14 01:36:04,406 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 110 predicate places. [2025-03-14 01:36:04,407 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 806 transitions, 10052 flow [2025-03-14 01:36:04,408 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-14 01:36:04,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:04,408 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-14 01:36:04,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:36:04,408 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-14 01:36:04,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1135270513, now seen corresponding path program 5 times [2025-03-14 01:36:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683908316] [2025-03-14 01:36:04,410 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:36:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:04,427 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-14 01:36:04,434 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:36:04,435 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:36:04,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:04,847 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-14 01:36:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683908316] [2025-03-14 01:36:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683908316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941551383] [2025-03-14 01:36:04,847 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:36:04,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:04,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:36:04,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:36:04,960 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-14 01:36:05,003 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:36:05,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:36:05,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:05,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 01:36:05,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:05,189 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-14 01:36:05,219 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-14 01:36:05,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:05,252 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-14 01:36:05,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:05,370 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-14 01:36:05,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:05,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:05,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:05,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:05,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:05,455 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-14 01:36:05,487 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-14 01:36:05,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:07,141 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:36:07,385 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-14 01:36:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941551383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:07,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-14 01:36:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883807851] [2025-03-14 01:36:07,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:07,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:36:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:07,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:36:07,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 01:36:09,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:36:12,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:36:25,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:36:36,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:36:45,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:36:54,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:00,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:09,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:14,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:18,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:19,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]