/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:25:04,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:25:04,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:25:04,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:25:04,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:25:04,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:25:04,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:25:04,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:25:04,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:25:04,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:25:04,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:25:04,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:25:04,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:25:04,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:25:04,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:25:04,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:25:04,429 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:25:04,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2025-03-15 01:25:05,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b38006a/097eaac673e24e0e9b9934d4c00bbcf9/FLAG313cabac7 [2025-03-15 01:25:05,850 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:25:05,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2025-03-15 01:25:05,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b38006a/097eaac673e24e0e9b9934d4c00bbcf9/FLAG313cabac7 [2025-03-15 01:25:06,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b38006a/097eaac673e24e0e9b9934d4c00bbcf9 [2025-03-15 01:25:06,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:25:06,187 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:25:06,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:25:06,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:25:06,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:25:06,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8dcbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06, skipping insertion in model container [2025-03-15 01:25:06,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:25:06,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:25:06,509 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:25:06,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:25:06,663 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:25:06,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06 WrapperNode [2025-03-15 01:25:06,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:25:06,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:25:06,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:25:06,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:25:06,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,775 INFO L138 Inliner]: procedures = 277, calls = 831, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 951 [2025-03-15 01:25:06,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:25:06,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:25:06,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:25:06,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:25:06,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:25:06,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:25:06,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:25:06,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:25:06,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (1/1) ... [2025-03-15 01:25:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:25:06,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:06,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:25:06,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:25:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:25:06,906 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:25:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:25:06,907 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:25:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:25:06,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:25:06,909 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:25:07,024 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:25:07,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:25:07,990 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:25:07,991 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:25:08,032 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:25:08,032 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:25:08,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:25:08 BoogieIcfgContainer [2025-03-15 01:25:08,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:25:08,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:25:08,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:25:08,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:25:08,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:25:06" (1/3) ... [2025-03-15 01:25:08,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f715180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:25:08, skipping insertion in model container [2025-03-15 01:25:08,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:06" (2/3) ... [2025-03-15 01:25:08,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f715180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:25:08, skipping insertion in model container [2025-03-15 01:25:08,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:25:08" (3/3) ... [2025-03-15 01:25:08,044 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-03-15 01:25:08,056 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:25:08,059 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 965 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:25:08,059 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:25:08,176 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:25:08,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:25:08,235 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=All, 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;@5578eb3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:25:08,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:25:08,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:25:08,515 INFO L124 PetriNetUnfolderBase]: 1/873 cut-off events. [2025-03-15 01:25:08,518 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-15 01:25:08,518 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:08,519 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:08,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash -537193547, now seen corresponding path program 1 times [2025-03-15 01:25:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775168796] [2025-03-15 01:25:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:09,736 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-15 01:25:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775168796] [2025-03-15 01:25:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775168796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:09,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:09,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331488236] [2025-03-15 01:25:09,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:09,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:09,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:09,786 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 948 out of 974 [2025-03-15 01:25:09,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 974 transitions, 1962 flow. Second operand has 4 states, 4 states have (on average 950.25) internal successors, (3801), 4 states have internal predecessors, (3801), 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-15 01:25:09,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:09,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 948 of 974 [2025-03-15 01:25:09,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:10,356 INFO L124 PetriNetUnfolderBase]: 128/1542 cut-off events. [2025-03-15 01:25:10,357 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-03-15 01:25:10,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1542 events. 128/1542 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4674 event pairs, 38 based on Foata normal form. 47/1491 useless extension candidates. Maximal degree in co-relation 901. Up to 125 conditions per place. [2025-03-15 01:25:10,375 INFO L140 encePairwiseOnDemand]: 962/974 looper letters, 31 selfloop transitions, 4 changer transitions 5/978 dead transitions. [2025-03-15 01:25:10,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 967 places, 978 transitions, 2049 flow [2025-03-15 01:25:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4795 transitions. [2025-03-15 01:25:10,399 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9845995893223819 [2025-03-15 01:25:10,402 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, -4 predicate places. [2025-03-15 01:25:10,402 INFO L471 AbstractCegarLoop]: Abstraction has has 967 places, 978 transitions, 2049 flow [2025-03-15 01:25:10,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 950.25) internal successors, (3801), 4 states have internal predecessors, (3801), 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-15 01:25:10,404 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:10,404 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:10,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:25:10,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1362941787, now seen corresponding path program 1 times [2025-03-15 01:25:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423934129] [2025-03-15 01:25:10,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:11,361 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-15 01:25:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423934129] [2025-03-15 01:25:11,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423934129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:11,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:11,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:11,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214259539] [2025-03-15 01:25:11,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:11,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:11,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:11,373 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 946 out of 974 [2025-03-15 01:25:11,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 978 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 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-15 01:25:11,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:11,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 946 of 974 [2025-03-15 01:25:11,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:11,974 INFO L124 PetriNetUnfolderBase]: 393/2995 cut-off events. [2025-03-15 01:25:11,974 INFO L125 PetriNetUnfolderBase]: For 651/681 co-relation queries the response was YES. [2025-03-15 01:25:11,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2995 events. 393/2995 cut-off events. For 651/681 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16169 event pairs, 146 based on Foata normal form. 8/2692 useless extension candidates. Maximal degree in co-relation 3184. Up to 385 conditions per place. [2025-03-15 01:25:11,993 INFO L140 encePairwiseOnDemand]: 969/974 looper letters, 50 selfloop transitions, 3 changer transitions 6/1001 dead transitions. [2025-03-15 01:25:11,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 1001 transitions, 2259 flow [2025-03-15 01:25:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:25:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:25:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2873 transitions. [2025-03-15 01:25:11,999 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9832306639288159 [2025-03-15 01:25:12,000 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, -2 predicate places. [2025-03-15 01:25:12,000 INFO L471 AbstractCegarLoop]: Abstraction has has 969 places, 1001 transitions, 2259 flow [2025-03-15 01:25:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 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-15 01:25:12,002 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:12,002 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:25:12,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1704917075, now seen corresponding path program 1 times [2025-03-15 01:25:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:12,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968512645] [2025-03-15 01:25:12,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968512645] [2025-03-15 01:25:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968512645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967954543] [2025-03-15 01:25:12,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:12,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:12,677 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-15 01:25:12,679 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-15 01:25:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:12,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:25:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:13,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:13,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967954543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:13,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:25:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679215021] [2025-03-15 01:25:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:25:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:13,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:25:13,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:25:13,110 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 948 out of 974 [2025-03-15 01:25:13,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 1001 transitions, 2259 flow. Second operand has 5 states, 5 states have (on average 951.4) internal successors, (4757), 5 states have internal predecessors, (4757), 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-15 01:25:13,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:13,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 948 of 974 [2025-03-15 01:25:13,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:13,917 INFO L124 PetriNetUnfolderBase]: 369/2901 cut-off events. [2025-03-15 01:25:13,918 INFO L125 PetriNetUnfolderBase]: For 1176/1618 co-relation queries the response was YES. [2025-03-15 01:25:13,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 2901 events. 369/2901 cut-off events. For 1176/1618 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 15310 event pairs, 98 based on Foata normal form. 54/2675 useless extension candidates. Maximal degree in co-relation 3476. Up to 365 conditions per place. [2025-03-15 01:25:13,934 INFO L140 encePairwiseOnDemand]: 970/974 looper letters, 57 selfloop transitions, 5 changer transitions 6/1011 dead transitions. [2025-03-15 01:25:13,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1011 transitions, 2461 flow [2025-03-15 01:25:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:25:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:25:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3817 transitions. [2025-03-15 01:25:13,941 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9797227926078029 [2025-03-15 01:25:13,942 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 0 predicate places. [2025-03-15 01:25:13,942 INFO L471 AbstractCegarLoop]: Abstraction has has 971 places, 1011 transitions, 2461 flow [2025-03-15 01:25:13,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 951.4) internal successors, (4757), 5 states have internal predecessors, (4757), 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-15 01:25:13,945 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:13,945 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:13,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:25:14,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:14,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:14,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:14,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1312819639, now seen corresponding path program 1 times [2025-03-15 01:25:14,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:14,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929383848] [2025-03-15 01:25:14,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:14,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929383848] [2025-03-15 01:25:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929383848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:14,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232303946] [2025-03-15 01:25:14,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:14,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:14,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:14,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:14,474 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 948 out of 974 [2025-03-15 01:25:14,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 1011 transitions, 2461 flow. Second operand has 4 states, 4 states have (on average 952.5) internal successors, (3810), 4 states have internal predecessors, (3810), 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-15 01:25:14,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:14,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 948 of 974 [2025-03-15 01:25:14,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:15,066 INFO L124 PetriNetUnfolderBase]: 361/2881 cut-off events. [2025-03-15 01:25:15,066 INFO L125 PetriNetUnfolderBase]: For 1880/2886 co-relation queries the response was YES. [2025-03-15 01:25:15,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4898 conditions, 2881 events. 361/2881 cut-off events. For 1880/2886 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 15128 event pairs, 98 based on Foata normal form. 119/2740 useless extension candidates. Maximal degree in co-relation 3836. Up to 362 conditions per place. [2025-03-15 01:25:15,077 INFO L140 encePairwiseOnDemand]: 968/974 looper letters, 58 selfloop transitions, 8 changer transitions 13/1022 dead transitions. [2025-03-15 01:25:15,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1022 transitions, 2713 flow [2025-03-15 01:25:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4768 transitions. [2025-03-15 01:25:15,083 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9790554414784394 [2025-03-15 01:25:15,084 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 3 predicate places. [2025-03-15 01:25:15,084 INFO L471 AbstractCegarLoop]: Abstraction has has 974 places, 1022 transitions, 2713 flow [2025-03-15 01:25:15,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 952.5) internal successors, (3810), 4 states have internal predecessors, (3810), 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-15 01:25:15,086 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:15,086 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:15,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:25:15,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1548648923, now seen corresponding path program 1 times [2025-03-15 01:25:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056029208] [2025-03-15 01:25:15,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:15,618 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-15 01:25:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:15,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056029208] [2025-03-15 01:25:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056029208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:15,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:15,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:15,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097285146] [2025-03-15 01:25:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:15,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:15,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:15,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:15,622 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 974 [2025-03-15 01:25:15,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 1022 transitions, 2713 flow. Second operand has 4 states, 4 states have (on average 941.0) internal successors, (3764), 4 states have internal predecessors, (3764), 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-15 01:25:15,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:15,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 974 [2025-03-15 01:25:15,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:16,387 INFO L124 PetriNetUnfolderBase]: 589/3712 cut-off events. [2025-03-15 01:25:16,387 INFO L125 PetriNetUnfolderBase]: For 4131/4852 co-relation queries the response was YES. [2025-03-15 01:25:16,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 3712 events. 589/3712 cut-off events. For 4131/4852 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 22778 event pairs, 141 based on Foata normal form. 60/3434 useless extension candidates. Maximal degree in co-relation 6370. Up to 651 conditions per place. [2025-03-15 01:25:16,403 INFO L140 encePairwiseOnDemand]: 967/974 looper letters, 98 selfloop transitions, 8 changer transitions 13/1052 dead transitions. [2025-03-15 01:25:16,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 1052 transitions, 3107 flow [2025-03-15 01:25:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4763 transitions. [2025-03-15 01:25:16,409 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9780287474332648 [2025-03-15 01:25:16,410 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 7 predicate places. [2025-03-15 01:25:16,410 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1052 transitions, 3107 flow [2025-03-15 01:25:16,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 941.0) internal successors, (3764), 4 states have internal predecessors, (3764), 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-15 01:25:16,412 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:16,412 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:16,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:25:16,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:16,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash 66159935, now seen corresponding path program 1 times [2025-03-15 01:25:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:16,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775784835] [2025-03-15 01:25:16,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:16,721 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-15 01:25:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775784835] [2025-03-15 01:25:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775784835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:16,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499712649] [2025-03-15 01:25:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:16,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:16,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:16,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 948 out of 974 [2025-03-15 01:25:16,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1052 transitions, 3107 flow. Second operand has 4 states, 4 states have (on average 950.0) internal successors, (3800), 4 states have internal predecessors, (3800), 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-15 01:25:16,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:16,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 948 of 974 [2025-03-15 01:25:16,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:17,740 INFO L124 PetriNetUnfolderBase]: 833/4614 cut-off events. [2025-03-15 01:25:17,740 INFO L125 PetriNetUnfolderBase]: For 10321/11578 co-relation queries the response was YES. [2025-03-15 01:25:17,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10878 conditions, 4614 events. 833/4614 cut-off events. For 10321/11578 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 32936 event pairs, 203 based on Foata normal form. 67/4229 useless extension candidates. Maximal degree in co-relation 9441. Up to 822 conditions per place. [2025-03-15 01:25:17,769 INFO L140 encePairwiseOnDemand]: 967/974 looper letters, 128 selfloop transitions, 4 changer transitions 12/1111 dead transitions. [2025-03-15 01:25:17,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1111 transitions, 4044 flow [2025-03-15 01:25:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4779 transitions. [2025-03-15 01:25:17,776 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9813141683778234 [2025-03-15 01:25:17,776 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 11 predicate places. [2025-03-15 01:25:17,776 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1111 transitions, 4044 flow [2025-03-15 01:25:17,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 950.0) internal successors, (3800), 4 states have internal predecessors, (3800), 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-15 01:25:17,778 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:17,778 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:17,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:25:17,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1083886324, now seen corresponding path program 1 times [2025-03-15 01:25:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858782597] [2025-03-15 01:25:17,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:18,261 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-15 01:25:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858782597] [2025-03-15 01:25:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858782597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037123292] [2025-03-15 01:25:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:18,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:18,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:18,264 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 952 out of 974 [2025-03-15 01:25:18,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1111 transitions, 4044 flow. Second operand has 3 states, 3 states have (on average 955.6666666666666) internal successors, (2867), 3 states have internal predecessors, (2867), 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-15 01:25:18,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:18,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 952 of 974 [2025-03-15 01:25:18,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:18,625 INFO L124 PetriNetUnfolderBase]: 298/2229 cut-off events. [2025-03-15 01:25:18,626 INFO L125 PetriNetUnfolderBase]: For 14438/16223 co-relation queries the response was YES. [2025-03-15 01:25:18,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5400 conditions, 2229 events. 298/2229 cut-off events. For 14438/16223 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9280 event pairs, 69 based on Foata normal form. 148/2190 useless extension candidates. Maximal degree in co-relation 3906. Up to 307 conditions per place. [2025-03-15 01:25:18,641 INFO L140 encePairwiseOnDemand]: 970/974 looper letters, 30 selfloop transitions, 69 changer transitions 14/1074 dead transitions. [2025-03-15 01:25:18,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1074 transitions, 3907 flow [2025-03-15 01:25:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:25:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:25:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2875 transitions. [2025-03-15 01:25:18,647 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9839151266255989 [2025-03-15 01:25:18,648 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 13 predicate places. [2025-03-15 01:25:18,648 INFO L471 AbstractCegarLoop]: Abstraction has has 984 places, 1074 transitions, 3907 flow [2025-03-15 01:25:18,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 955.6666666666666) internal successors, (2867), 3 states have internal predecessors, (2867), 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-15 01:25:18,649 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:18,650 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:18,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:25:18,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:18,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1031315557, now seen corresponding path program 1 times [2025-03-15 01:25:18,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:18,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326456422] [2025-03-15 01:25:18,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:18,887 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-15 01:25:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:18,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326456422] [2025-03-15 01:25:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326456422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:18,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:18,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:18,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552768996] [2025-03-15 01:25:18,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:18,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:18,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:18,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:18,891 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 974 [2025-03-15 01:25:18,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 1074 transitions, 3907 flow. Second operand has 4 states, 4 states have (on average 942.75) internal successors, (3771), 4 states have internal predecessors, (3771), 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-15 01:25:18,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:18,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 974 [2025-03-15 01:25:18,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:19,336 INFO L124 PetriNetUnfolderBase]: 358/2362 cut-off events. [2025-03-15 01:25:19,336 INFO L125 PetriNetUnfolderBase]: For 20878/22560 co-relation queries the response was YES. [2025-03-15 01:25:19,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6619 conditions, 2362 events. 358/2362 cut-off events. For 20878/22560 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10190 event pairs, 69 based on Foata normal form. 58/2206 useless extension candidates. Maximal degree in co-relation 4581. Up to 467 conditions per place. [2025-03-15 01:25:19,347 INFO L140 encePairwiseOnDemand]: 965/974 looper letters, 135 selfloop transitions, 6 changer transitions 6/1087 dead transitions. [2025-03-15 01:25:19,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1087 transitions, 4428 flow [2025-03-15 01:25:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4738 transitions. [2025-03-15 01:25:19,352 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9728952772073922 [2025-03-15 01:25:19,352 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 13 predicate places. [2025-03-15 01:25:19,352 INFO L471 AbstractCegarLoop]: Abstraction has has 984 places, 1087 transitions, 4428 flow [2025-03-15 01:25:19,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 942.75) internal successors, (3771), 4 states have internal predecessors, (3771), 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-15 01:25:19,354 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:19,355 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:19,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:25:19,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:19,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1192378557, now seen corresponding path program 1 times [2025-03-15 01:25:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158297298] [2025-03-15 01:25:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:19,831 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-15 01:25:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158297298] [2025-03-15 01:25:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158297298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:19,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651127733] [2025-03-15 01:25:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:19,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:19,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:19,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:19,836 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 974 [2025-03-15 01:25:19,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 1087 transitions, 4428 flow. Second operand has 6 states, 6 states have (on average 935.5) internal successors, (5613), 6 states have internal predecessors, (5613), 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-15 01:25:19,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:19,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 974 [2025-03-15 01:25:19,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:20,446 INFO L124 PetriNetUnfolderBase]: 439/2848 cut-off events. [2025-03-15 01:25:20,447 INFO L125 PetriNetUnfolderBase]: For 28693/30612 co-relation queries the response was YES. [2025-03-15 01:25:20,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8965 conditions, 2848 events. 439/2848 cut-off events. For 28693/30612 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13400 event pairs, 90 based on Foata normal form. 66/2633 useless extension candidates. Maximal degree in co-relation 6583. Up to 618 conditions per place. [2025-03-15 01:25:20,460 INFO L140 encePairwiseOnDemand]: 965/974 looper letters, 181 selfloop transitions, 8 changer transitions 21/1139 dead transitions. [2025-03-15 01:25:20,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 1139 transitions, 5579 flow [2025-03-15 01:25:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6603 transitions. [2025-03-15 01:25:20,467 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9684658257553534 [2025-03-15 01:25:20,468 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 19 predicate places. [2025-03-15 01:25:20,468 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1139 transitions, 5579 flow [2025-03-15 01:25:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 935.5) internal successors, (5613), 6 states have internal predecessors, (5613), 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-15 01:25:20,470 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:20,470 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:20,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:25:20,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -313703946, now seen corresponding path program 1 times [2025-03-15 01:25:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107585631] [2025-03-15 01:25:20,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:20,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:20,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:20,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107585631] [2025-03-15 01:25:20,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107585631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:20,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491758375] [2025-03-15 01:25:20,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:20,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:20,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:25:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:21,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1812 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:21,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:21,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491758375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:25:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181814504] [2025-03-15 01:25:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:21,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:21,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:21,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:21,964 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 974 [2025-03-15 01:25:21,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1139 transitions, 5579 flow. Second operand has 6 states, 6 states have (on average 942.1666666666666) internal successors, (5653), 6 states have internal predecessors, (5653), 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-15 01:25:21,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:21,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 974 [2025-03-15 01:25:21,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:22,665 INFO L124 PetriNetUnfolderBase]: 511/3198 cut-off events. [2025-03-15 01:25:22,666 INFO L125 PetriNetUnfolderBase]: For 42098/44450 co-relation queries the response was YES. [2025-03-15 01:25:22,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11190 conditions, 3198 events. 511/3198 cut-off events. For 42098/44450 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 16904 event pairs, 99 based on Foata normal form. 76/2946 useless extension candidates. Maximal degree in co-relation 8691. Up to 722 conditions per place. [2025-03-15 01:25:22,681 INFO L140 encePairwiseOnDemand]: 964/974 looper letters, 221 selfloop transitions, 15 changer transitions 33/1209 dead transitions. [2025-03-15 01:25:22,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 1209 transitions, 7328 flow [2025-03-15 01:25:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7574 transitions. [2025-03-15 01:25:22,688 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9720225872689938 [2025-03-15 01:25:22,689 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 26 predicate places. [2025-03-15 01:25:22,689 INFO L471 AbstractCegarLoop]: Abstraction has has 997 places, 1209 transitions, 7328 flow [2025-03-15 01:25:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 942.1666666666666) internal successors, (5653), 6 states have internal predecessors, (5653), 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-15 01:25:22,691 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:22,691 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:22,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 01:25:22,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-15 01:25:22,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1134885642, now seen corresponding path program 1 times [2025-03-15 01:25:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:22,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138188757] [2025-03-15 01:25:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:23,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:23,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138188757] [2025-03-15 01:25:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138188757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:23,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96720221] [2025-03-15 01:25:23,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:23,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:23,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:23,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 01:25:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:23,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1813 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:23,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:24,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96720221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:24,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 01:25:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121374336] [2025-03-15 01:25:24,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:24,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:25:25,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:25,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:25:25,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:25:25,006 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 974 [2025-03-15 01:25:25,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 1209 transitions, 7328 flow. Second operand has 12 states, 12 states have (on average 943.1666666666666) internal successors, (11318), 12 states have internal predecessors, (11318), 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-15 01:25:25,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:25,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 974 [2025-03-15 01:25:25,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:26,606 INFO L124 PetriNetUnfolderBase]: 953/5955 cut-off events. [2025-03-15 01:25:26,606 INFO L125 PetriNetUnfolderBase]: For 93684/98510 co-relation queries the response was YES. [2025-03-15 01:25:26,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23131 conditions, 5955 events. 953/5955 cut-off events. For 93684/98510 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 40204 event pairs, 200 based on Foata normal form. 150/5409 useless extension candidates. Maximal degree in co-relation 19807. Up to 1581 conditions per place. [2025-03-15 01:25:26,634 INFO L140 encePairwiseOnDemand]: 963/974 looper letters, 396 selfloop transitions, 48 changer transitions 47/1431 dead transitions. [2025-03-15 01:25:26,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1431 transitions, 12463 flow [2025-03-15 01:25:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 01:25:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 01:25:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 18913 transitions. [2025-03-15 01:25:26,650 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9708932238193019 [2025-03-15 01:25:26,651 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 45 predicate places. [2025-03-15 01:25:26,651 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1431 transitions, 12463 flow [2025-03-15 01:25:26,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 943.1666666666666) internal successors, (11318), 12 states have internal predecessors, (11318), 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-15 01:25:26,653 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:26,653 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:26,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 01:25:26,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:26,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:26,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash 890078542, now seen corresponding path program 1 times [2025-03-15 01:25:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:26,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000410631] [2025-03-15 01:25:26,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000410631] [2025-03-15 01:25:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000410631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852376443] [2025-03-15 01:25:27,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:27,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:27,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:27,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:27,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 01:25:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:27,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:27,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:27,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852376443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:25:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464438469] [2025-03-15 01:25:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:27,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:27,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:27,475 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 948 out of 974 [2025-03-15 01:25:27,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1431 transitions, 12463 flow. Second operand has 6 states, 6 states have (on average 950.6666666666666) internal successors, (5704), 6 states have internal predecessors, (5704), 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-15 01:25:27,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:27,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 948 of 974 [2025-03-15 01:25:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:28,689 INFO L124 PetriNetUnfolderBase]: 922/5823 cut-off events. [2025-03-15 01:25:28,689 INFO L125 PetriNetUnfolderBase]: For 100751/107234 co-relation queries the response was YES. [2025-03-15 01:25:28,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23981 conditions, 5823 events. 922/5823 cut-off events. For 100751/107234 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 38503 event pairs, 143 based on Foata normal form. 185/5417 useless extension candidates. Maximal degree in co-relation 20551. Up to 1524 conditions per place. [2025-03-15 01:25:28,723 INFO L140 encePairwiseOnDemand]: 969/974 looper letters, 323 selfloop transitions, 6 changer transitions 47/1450 dead transitions. [2025-03-15 01:25:28,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1450 transitions, 13695 flow [2025-03-15 01:25:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6678 transitions. [2025-03-15 01:25:28,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9794661190965093 [2025-03-15 01:25:28,727 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 50 predicate places. [2025-03-15 01:25:28,727 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1450 transitions, 13695 flow [2025-03-15 01:25:28,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 950.6666666666666) internal successors, (5704), 6 states have internal predecessors, (5704), 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-15 01:25:28,728 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:28,728 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:28,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:28,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:28,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:28,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1822633133, now seen corresponding path program 1 times [2025-03-15 01:25:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410479343] [2025-03-15 01:25:28,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410479343] [2025-03-15 01:25:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410479343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:29,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097931634] [2025-03-15 01:25:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:29,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:29,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:29,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:29,135 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 948 out of 974 [2025-03-15 01:25:29,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1450 transitions, 13695 flow. Second operand has 4 states, 4 states have (on average 952.25) internal successors, (3809), 4 states have internal predecessors, (3809), 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-15 01:25:29,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:29,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 948 of 974 [2025-03-15 01:25:29,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:30,574 INFO L124 PetriNetUnfolderBase]: 885/5732 cut-off events. [2025-03-15 01:25:30,575 INFO L125 PetriNetUnfolderBase]: For 101546/107926 co-relation queries the response was YES. [2025-03-15 01:25:30,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24627 conditions, 5732 events. 885/5732 cut-off events. For 101546/107926 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 38225 event pairs, 96 based on Foata normal form. 325/5525 useless extension candidates. Maximal degree in co-relation 21107. Up to 1488 conditions per place. [2025-03-15 01:25:30,598 INFO L140 encePairwiseOnDemand]: 968/974 looper letters, 366 selfloop transitions, 8 changer transitions 47/1495 dead transitions. [2025-03-15 01:25:30,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1495 transitions, 15746 flow [2025-03-15 01:25:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4768 transitions. [2025-03-15 01:25:30,601 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9790554414784394 [2025-03-15 01:25:30,601 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 53 predicate places. [2025-03-15 01:25:30,601 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1495 transitions, 15746 flow [2025-03-15 01:25:30,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 952.25) internal successors, (3809), 4 states have internal predecessors, (3809), 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-15 01:25:30,602 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:30,603 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:30,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:25:30,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:30,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash -8017632, now seen corresponding path program 1 times [2025-03-15 01:25:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539656740] [2025-03-15 01:25:30,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539656740] [2025-03-15 01:25:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539656740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376596452] [2025-03-15 01:25:31,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:31,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:31,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:31,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 01:25:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:31,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 01:25:31,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:31,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376596452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:32,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 01:25:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503377775] [2025-03-15 01:25:32,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 01:25:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:32,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 01:25:32,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-15 01:25:32,507 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 974 [2025-03-15 01:25:32,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1495 transitions, 15746 flow. Second operand has 16 states, 16 states have (on average 936.6875) internal successors, (14987), 16 states have internal predecessors, (14987), 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-15 01:25:32,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:32,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 974 [2025-03-15 01:25:32,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:34,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1367], [3561#true, 980#true, 974#true, 20173#(and (<= ~top~0 2147483647) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483648)), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 125#L1023-1true, 6311#true, 3594#true, 3579#(<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 772#L949-4true]) [2025-03-15 01:25:34,489 INFO L294 olderBase$Statistics]: this new event has 1050 ancestors and is cut-off event [2025-03-15 01:25:34,489 INFO L297 olderBase$Statistics]: existing Event has 1005 ancestors and is cut-off event [2025-03-15 01:25:34,489 INFO L297 olderBase$Statistics]: existing Event has 1031 ancestors and is cut-off event [2025-03-15 01:25:34,489 INFO L297 olderBase$Statistics]: existing Event has 1039 ancestors and is cut-off event [2025-03-15 01:25:34,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1374], [3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 6311#true, 125#L1023-1true, 3582#true, 3594#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3576#true, 202#L947true]) [2025-03-15 01:25:34,499 INFO L294 olderBase$Statistics]: this new event has 1051 ancestors and is cut-off event [2025-03-15 01:25:34,499 INFO L297 olderBase$Statistics]: existing Event has 1032 ancestors and is cut-off event [2025-03-15 01:25:34,499 INFO L297 olderBase$Statistics]: existing Event has 1006 ancestors and is cut-off event [2025-03-15 01:25:34,499 INFO L297 olderBase$Statistics]: existing Event has 1040 ancestors and is cut-off event [2025-03-15 01:25:34,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1374], [3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 125#L1023-1true, 6311#true, 3594#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3576#true, 596#L983true]) [2025-03-15 01:25:34,506 INFO L294 olderBase$Statistics]: this new event has 1052 ancestors and is cut-off event [2025-03-15 01:25:34,506 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 01:25:34,506 INFO L297 olderBase$Statistics]: existing Event has 1041 ancestors and is cut-off event [2025-03-15 01:25:34,506 INFO L297 olderBase$Statistics]: existing Event has 1033 ancestors and is cut-off event [2025-03-15 01:25:34,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1374], [3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 125#L1023-1true, 6311#true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 3576#true, 12#get_top_returnLabel#1true]) [2025-03-15 01:25:34,515 INFO L294 olderBase$Statistics]: this new event has 1054 ancestors and is cut-off event [2025-03-15 01:25:34,516 INFO L297 olderBase$Statistics]: existing Event has 1043 ancestors and is cut-off event [2025-03-15 01:25:34,516 INFO L297 olderBase$Statistics]: existing Event has 1009 ancestors and is cut-off event [2025-03-15 01:25:34,516 INFO L297 olderBase$Statistics]: existing Event has 1035 ancestors and is cut-off event [2025-03-15 01:25:34,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2093] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][1434], [3561#true, 980#true, 248#L1000true, 974#true, 17434#(< ~top~0 2147483648), 3567#true, t1Thread1of1ForFork1InUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3573#true, 14519#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 15#L1022-4true, 611#L1013-2true, 3576#true]) [2025-03-15 01:25:34,551 INFO L294 olderBase$Statistics]: this new event has 1062 ancestors and is cut-off event [2025-03-15 01:25:34,551 INFO L297 olderBase$Statistics]: existing Event has 1043 ancestors and is cut-off event [2025-03-15 01:25:34,551 INFO L297 olderBase$Statistics]: existing Event has 1017 ancestors and is cut-off event [2025-03-15 01:25:34,551 INFO L297 olderBase$Statistics]: existing Event has 1051 ancestors and is cut-off event [2025-03-15 01:25:34,649 INFO L124 PetriNetUnfolderBase]: 1039/6501 cut-off events. [2025-03-15 01:25:34,649 INFO L125 PetriNetUnfolderBase]: For 131786/138219 co-relation queries the response was YES. [2025-03-15 01:25:34,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30581 conditions, 6501 events. 1039/6501 cut-off events. For 131786/138219 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 46005 event pairs, 113 based on Foata normal form. 141/6067 useless extension candidates. Maximal degree in co-relation 26849. Up to 1732 conditions per place. [2025-03-15 01:25:34,681 INFO L140 encePairwiseOnDemand]: 961/974 looper letters, 452 selfloop transitions, 71 changer transitions 154/1604 dead transitions. [2025-03-15 01:25:34,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1604 transitions, 19518 flow [2025-03-15 01:25:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-15 01:25:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-15 01:25:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 22520 transitions. [2025-03-15 01:25:34,691 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9633812457221081 [2025-03-15 01:25:34,692 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 75 predicate places. [2025-03-15 01:25:34,692 INFO L471 AbstractCegarLoop]: Abstraction has has 1046 places, 1604 transitions, 19518 flow [2025-03-15 01:25:34,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 936.6875) internal successors, (14987), 16 states have internal predecessors, (14987), 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-15 01:25:34,696 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:34,696 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:34,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 01:25:34,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-15 01:25:34,897 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:34,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1498111295, now seen corresponding path program 1 times [2025-03-15 01:25:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014291101] [2025-03-15 01:25:34,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:35,144 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-15 01:25:35,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014291101] [2025-03-15 01:25:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014291101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:35,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611907772] [2025-03-15 01:25:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:35,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:35,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:35,148 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 974 [2025-03-15 01:25:35,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1604 transitions, 19518 flow. Second operand has 6 states, 6 states have (on average 937.3333333333334) internal successors, (5624), 6 states have internal predecessors, (5624), 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-15 01:25:35,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:35,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 974 [2025-03-15 01:25:35,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:36,988 INFO L124 PetriNetUnfolderBase]: 1068/7006 cut-off events. [2025-03-15 01:25:36,989 INFO L125 PetriNetUnfolderBase]: For 150368/156468 co-relation queries the response was YES. [2025-03-15 01:25:37,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34338 conditions, 7006 events. 1068/7006 cut-off events. For 150368/156468 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 52434 event pairs, 127 based on Foata normal form. 135/6556 useless extension candidates. Maximal degree in co-relation 30404. Up to 1813 conditions per place. [2025-03-15 01:25:37,034 INFO L140 encePairwiseOnDemand]: 963/974 looper letters, 477 selfloop transitions, 55 changer transitions 163/1622 dead transitions. [2025-03-15 01:25:37,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1622 transitions, 21511 flow [2025-03-15 01:25:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7509 transitions. [2025-03-15 01:25:37,038 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9636806981519507 [2025-03-15 01:25:37,039 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 76 predicate places. [2025-03-15 01:25:37,039 INFO L471 AbstractCegarLoop]: Abstraction has has 1047 places, 1622 transitions, 21511 flow [2025-03-15 01:25:37,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 937.3333333333334) internal successors, (5624), 6 states have internal predecessors, (5624), 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-15 01:25:37,040 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:37,040 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:25:37,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 641041453, now seen corresponding path program 1 times [2025-03-15 01:25:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018002920] [2025-03-15 01:25:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018002920] [2025-03-15 01:25:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018002920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421861758] [2025-03-15 01:25:37,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:37,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:37,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:37,887 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:37,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:25:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:38,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 2060 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 01:25:38,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:38,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421861758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:39,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-15 01:25:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847357362] [2025-03-15 01:25:39,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:39,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:25:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:39,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:25:39,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:25:39,579 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 974 [2025-03-15 01:25:39,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 1622 transitions, 21511 flow. Second operand has 20 states, 20 states have (on average 937.45) internal successors, (18749), 20 states have internal predecessors, (18749), 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-15 01:25:39,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:39,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 974 [2025-03-15 01:25:39,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:43,010 INFO L124 PetriNetUnfolderBase]: 1644/10685 cut-off events. [2025-03-15 01:25:43,010 INFO L125 PetriNetUnfolderBase]: For 265009/275362 co-relation queries the response was YES. [2025-03-15 01:25:43,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56451 conditions, 10685 events. 1644/10685 cut-off events. For 265009/275362 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 90305 event pairs, 207 based on Foata normal form. 221/10019 useless extension candidates. Maximal degree in co-relation 50604. Up to 2931 conditions per place. [2025-03-15 01:25:43,074 INFO L140 encePairwiseOnDemand]: 963/974 looper letters, 714 selfloop transitions, 97 changer transitions 251/1989 dead transitions. [2025-03-15 01:25:43,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1079 places, 1989 transitions, 33855 flow [2025-03-15 01:25:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:25:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:25:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 30977 transitions. [2025-03-15 01:25:43,088 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9637545890112625 [2025-03-15 01:25:43,088 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 108 predicate places. [2025-03-15 01:25:43,088 INFO L471 AbstractCegarLoop]: Abstraction has has 1079 places, 1989 transitions, 33855 flow [2025-03-15 01:25:43,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 937.45) internal successors, (18749), 20 states have internal predecessors, (18749), 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-15 01:25:43,090 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:43,090 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:43,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:43,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-15 01:25:43,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:43,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1192612852, now seen corresponding path program 1 times [2025-03-15 01:25:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279495180] [2025-03-15 01:25:43,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279495180] [2025-03-15 01:25:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279495180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:44,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349750348] [2025-03-15 01:25:44,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:44,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:44,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:44,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:44,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 01:25:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:44,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:25:44,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:45,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:45,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349750348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:45,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:45,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2025-03-15 01:25:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076035611] [2025-03-15 01:25:45,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:45,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:25:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:45,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:25:45,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:25:45,996 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 974 [2025-03-15 01:25:46,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1079 places, 1989 transitions, 33855 flow. Second operand has 20 states, 20 states have (on average 938.15) internal successors, (18763), 20 states have internal predecessors, (18763), 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-15 01:25:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 974 [2025-03-15 01:25:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:52,429 INFO L124 PetriNetUnfolderBase]: 2494/15544 cut-off events. [2025-03-15 01:25:52,430 INFO L125 PetriNetUnfolderBase]: For 452008/469504 co-relation queries the response was YES. [2025-03-15 01:25:52,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89124 conditions, 15544 events. 2494/15544 cut-off events. For 452008/469504 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 142443 event pairs, 283 based on Foata normal form. 293/14423 useless extension candidates. Maximal degree in co-relation 82327. Up to 4414 conditions per place. [2025-03-15 01:25:52,543 INFO L140 encePairwiseOnDemand]: 962/974 looper letters, 1161 selfloop transitions, 172 changer transitions 413/2673 dead transitions. [2025-03-15 01:25:52,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1109 places, 2673 transitions, 56721 flow [2025-03-15 01:25:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:25:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:25:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 29109 transitions. [2025-03-15 01:25:52,561 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9640657084188912 [2025-03-15 01:25:52,562 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 138 predicate places. [2025-03-15 01:25:52,562 INFO L471 AbstractCegarLoop]: Abstraction has has 1109 places, 2673 transitions, 56721 flow [2025-03-15 01:25:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 938.15) internal successors, (18763), 20 states have internal predecessors, (18763), 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-15 01:25:52,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:52,564 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:25:52,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:25:52,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:52,765 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:52,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1198556103, now seen corresponding path program 2 times [2025-03-15 01:25:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:52,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723024946] [2025-03-15 01:25:52,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:52,916 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:52,916 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 0 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723024946] [2025-03-15 01:25:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723024946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592446961] [2025-03-15 01:25:53,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:53,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:53,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:53,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 01:25:54,079 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:54,080 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:54,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 2223 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:25:54,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 0 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:54,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 0 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592446961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:55,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:55,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-15 01:25:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184828721] [2025-03-15 01:25:55,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-15 01:25:55,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:55,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-15 01:25:55,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-15 01:25:55,606 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 974 [2025-03-15 01:25:55,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1109 places, 2673 transitions, 56721 flow. Second operand has 32 states, 32 states have (on average 944.0) internal successors, (30208), 32 states have internal predecessors, (30208), 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-15 01:25:55,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:55,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 974 [2025-03-15 01:25:55,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:08,499 INFO L124 PetriNetUnfolderBase]: 3691/24613 cut-off events. [2025-03-15 01:26:08,499 INFO L125 PetriNetUnfolderBase]: For 722531/747253 co-relation queries the response was YES. [2025-03-15 01:26:08,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145078 conditions, 24613 events. 3691/24613 cut-off events. For 722531/747253 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 221437 event pairs, 562 based on Foata normal form. 259/22635 useless extension candidates. Maximal degree in co-relation 132303. Up to 7252 conditions per place. [2025-03-15 01:26:08,700 INFO L140 encePairwiseOnDemand]: 965/974 looper letters, 1647 selfloop transitions, 185 changer transitions 596/3448 dead transitions. [2025-03-15 01:26:08,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1155 places, 3448 transitions, 86982 flow [2025-03-15 01:26:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-15 01:26:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-15 01:26:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 44478 transitions. [2025-03-15 01:26:08,722 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9716020796015553 [2025-03-15 01:26:08,723 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 184 predicate places. [2025-03-15 01:26:08,723 INFO L471 AbstractCegarLoop]: Abstraction has has 1155 places, 3448 transitions, 86982 flow [2025-03-15 01:26:08,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 944.0) internal successors, (30208), 32 states have internal predecessors, (30208), 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-15 01:26:08,726 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:08,726 INFO L221 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:26:08,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 01:26:08,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 01:26:08,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:08,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -831026661, now seen corresponding path program 2 times [2025-03-15 01:26:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590859778] [2025-03-15 01:26:08,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:09,161 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:09,161 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590859778] [2025-03-15 01:26:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590859778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826408053] [2025-03-15 01:26:10,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:10,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:10,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:10,347 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:26:10,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 01:26:10,599 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:10,599 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:10,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 2388 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 01:26:10,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:11,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826408053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:12,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2025-03-15 01:26:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396439979] [2025-03-15 01:26:12,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 01:26:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:12,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 01:26:12,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 01:26:12,272 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 974 [2025-03-15 01:26:12,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1155 places, 3448 transitions, 86982 flow. Second operand has 34 states, 34 states have (on average 937.5) internal successors, (31875), 34 states have internal predecessors, (31875), 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-15 01:26:12,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:12,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 974 [2025-03-15 01:26:12,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:28,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][2846], [26456#true, 3561#true, 980#true, 974#true, 20173#(and (<= ~top~0 2147483647) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483648)), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 125#L1023-1true, 3582#true, 6311#true, 3594#true, 47401#(and (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483646) (<= ~top~0 2147483645)), 3579#(<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 772#L949-4true, 26441#(and (<= ~top~0 2147483646) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483647)), 20197#(and (<= 0 ~top~0) (<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|)), 33202#true]) [2025-03-15 01:26:28,293 INFO L294 olderBase$Statistics]: this new event has 1230 ancestors and is cut-off event [2025-03-15 01:26:28,293 INFO L297 olderBase$Statistics]: existing Event has 1203 ancestors and is cut-off event [2025-03-15 01:26:28,293 INFO L297 olderBase$Statistics]: existing Event has 1166 ancestors and is cut-off event [2025-03-15 01:26:28,293 INFO L297 olderBase$Statistics]: existing Event has 1185 ancestors and is cut-off event [2025-03-15 01:26:28,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][2870], [3561#true, 26456#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 6311#true, 125#L1023-1true, 3582#true, 3594#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 43856#(< ~top~0 2147483646), 3576#true, 33202#true, 202#L947true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:26:28,354 INFO L294 olderBase$Statistics]: this new event has 1231 ancestors and is cut-off event [2025-03-15 01:26:28,354 INFO L297 olderBase$Statistics]: existing Event has 1186 ancestors and is cut-off event [2025-03-15 01:26:28,354 INFO L297 olderBase$Statistics]: existing Event has 1204 ancestors and is cut-off event [2025-03-15 01:26:28,354 INFO L297 olderBase$Statistics]: existing Event has 1167 ancestors and is cut-off event [2025-03-15 01:26:28,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][2870], [26456#true, 3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 125#L1023-1true, 3594#true, 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 33202#true, 596#L983true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:26:28,414 INFO L294 olderBase$Statistics]: this new event has 1232 ancestors and is cut-off event [2025-03-15 01:26:28,414 INFO L297 olderBase$Statistics]: existing Event has 1168 ancestors and is cut-off event [2025-03-15 01:26:28,414 INFO L297 olderBase$Statistics]: existing Event has 1187 ancestors and is cut-off event [2025-03-15 01:26:28,414 INFO L297 olderBase$Statistics]: existing Event has 1205 ancestors and is cut-off event [2025-03-15 01:26:28,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][2870], [3561#true, 26456#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 125#L1023-1true, 3582#true, 6311#true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 43856#(< ~top~0 2147483646), 3576#true, 12#get_top_returnLabel#1true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:26:28,527 INFO L294 olderBase$Statistics]: this new event has 1234 ancestors and is cut-off event [2025-03-15 01:26:28,527 INFO L297 olderBase$Statistics]: existing Event has 1207 ancestors and is cut-off event [2025-03-15 01:26:28,527 INFO L297 olderBase$Statistics]: existing Event has 1170 ancestors and is cut-off event [2025-03-15 01:26:28,527 INFO L297 olderBase$Statistics]: existing Event has 1189 ancestors and is cut-off event [2025-03-15 01:26:29,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2093] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][3013], [26456#true, 3561#true, 980#true, 248#L1000true, 974#true, 17434#(< ~top~0 2147483648), 3567#true, 3573#true, t1Thread1of1ForFork1InUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 15#L1022-4true, 611#L1013-2true, 43856#(< ~top~0 2147483646), 3576#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:26:29,148 INFO L294 olderBase$Statistics]: this new event has 1242 ancestors and is cut-off event [2025-03-15 01:26:29,148 INFO L297 olderBase$Statistics]: existing Event has 1178 ancestors and is cut-off event [2025-03-15 01:26:29,148 INFO L297 olderBase$Statistics]: existing Event has 1197 ancestors and is cut-off event [2025-03-15 01:26:29,148 INFO L297 olderBase$Statistics]: existing Event has 1215 ancestors and is cut-off event [2025-03-15 01:26:35,493 INFO L124 PetriNetUnfolderBase]: 5264/36155 cut-off events. [2025-03-15 01:26:35,493 INFO L125 PetriNetUnfolderBase]: For 1111032/1149958 co-relation queries the response was YES. [2025-03-15 01:26:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221824 conditions, 36155 events. 5264/36155 cut-off events. For 1111032/1149958 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 372221 event pairs, 847 based on Foata normal form. 426/33321 useless extension candidates. Maximal degree in co-relation 208111. Up to 10843 conditions per place. [2025-03-15 01:26:35,795 INFO L140 encePairwiseOnDemand]: 963/974 looper letters, 2443 selfloop transitions, 377 changer transitions 881/4628 dead transitions. [2025-03-15 01:26:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1214 places, 4628 transitions, 132045 flow [2025-03-15 01:26:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-15 01:26:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-15 01:26:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 56331 transitions. [2025-03-15 01:26:35,810 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.963911704312115 [2025-03-15 01:26:35,811 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 243 predicate places. [2025-03-15 01:26:35,811 INFO L471 AbstractCegarLoop]: Abstraction has has 1214 places, 4628 transitions, 132045 flow [2025-03-15 01:26:35,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 937.5) internal successors, (31875), 34 states have internal predecessors, (31875), 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-15 01:26:35,814 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:35,814 INFO L221 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:26:35,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 01:26:36,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:36,015 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:36,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1097272777, now seen corresponding path program 2 times [2025-03-15 01:26:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591224443] [2025-03-15 01:26:36,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:36,206 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:36,207 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591224443] [2025-03-15 01:26:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591224443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621398993] [2025-03-15 01:26:38,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:38,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:38,868 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:26:38,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 01:26:39,246 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:39,246 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:39,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-15 01:26:39,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:40,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:40,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621398993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:40,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:40,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2025-03-15 01:26:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852533050] [2025-03-15 01:26:40,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:40,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 01:26:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:40,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 01:26:40,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 01:26:40,989 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 925 out of 974 [2025-03-15 01:26:40,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1214 places, 4628 transitions, 132045 flow. Second operand has 34 states, 34 states have (on average 931.5) internal successors, (31671), 34 states have internal predecessors, (31671), 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-15 01:26:40,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:40,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 925 of 974 [2025-03-15 01:26:40,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:14,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3090], [3561#true, 26456#true, 980#true, 974#true, 20173#(and (<= ~top~0 2147483647) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483648)), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 125#L1023-1true, 6311#true, 3582#true, 3594#true, 47401#(and (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483646) (<= ~top~0 2147483645)), 3579#(<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 772#L949-4true, 55023#(and (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483644) (<= ~top~0 2147483643)), 26441#(and (<= ~top~0 2147483646) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483647)), 20197#(and (<= 0 ~top~0) (<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|)), 33202#true]) [2025-03-15 01:27:14,682 INFO L294 olderBase$Statistics]: this new event has 1275 ancestors and is cut-off event [2025-03-15 01:27:14,682 INFO L297 olderBase$Statistics]: existing Event has 1185 ancestors and is cut-off event [2025-03-15 01:27:14,682 INFO L297 olderBase$Statistics]: existing Event has 1203 ancestors and is cut-off event [2025-03-15 01:27:14,682 INFO L297 olderBase$Statistics]: existing Event has 1166 ancestors and is cut-off event [2025-03-15 01:27:14,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [26456#true, 3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 125#L1023-1true, 6311#true, 3582#true, 3594#true, 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 202#L947true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:14,830 INFO L294 olderBase$Statistics]: this new event has 1276 ancestors and is cut-off event [2025-03-15 01:27:14,830 INFO L297 olderBase$Statistics]: existing Event has 1167 ancestors and is cut-off event [2025-03-15 01:27:14,830 INFO L297 olderBase$Statistics]: existing Event has 1204 ancestors and is cut-off event [2025-03-15 01:27:14,830 INFO L297 olderBase$Statistics]: existing Event has 1186 ancestors and is cut-off event [2025-03-15 01:27:14,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [26456#true, 3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 125#L1023-1true, 3582#true, 6311#true, 3594#true, 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 596#L983true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:14,974 INFO L294 olderBase$Statistics]: this new event has 1277 ancestors and is cut-off event [2025-03-15 01:27:14,974 INFO L297 olderBase$Statistics]: existing Event has 1187 ancestors and is cut-off event [2025-03-15 01:27:14,974 INFO L297 olderBase$Statistics]: existing Event has 1168 ancestors and is cut-off event [2025-03-15 01:27:14,974 INFO L297 olderBase$Statistics]: existing Event has 1205 ancestors and is cut-off event [2025-03-15 01:27:15,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [26456#true, 3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 312#L953true, t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 125#L1023-1true, 6311#true, 3594#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:15,131 INFO L294 olderBase$Statistics]: this new event has 1278 ancestors and is cut-off event [2025-03-15 01:27:15,131 INFO L297 olderBase$Statistics]: existing Event has 1206 ancestors and is cut-off event [2025-03-15 01:27:15,131 INFO L297 olderBase$Statistics]: existing Event has 1188 ancestors and is cut-off event [2025-03-15 01:27:15,131 INFO L297 olderBase$Statistics]: existing Event has 1169 ancestors and is cut-off event [2025-03-15 01:27:15,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [3561#true, 26456#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 125#L1023-1true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 43856#(< ~top~0 2147483646), 12#get_top_returnLabel#1true, 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:15,286 INFO L294 olderBase$Statistics]: this new event has 1279 ancestors and is cut-off event [2025-03-15 01:27:15,287 INFO L297 olderBase$Statistics]: existing Event has 1207 ancestors and is cut-off event [2025-03-15 01:27:15,287 INFO L297 olderBase$Statistics]: existing Event has 1170 ancestors and is cut-off event [2025-03-15 01:27:15,287 INFO L297 olderBase$Statistics]: existing Event has 1189 ancestors and is cut-off event [2025-03-15 01:27:15,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [26456#true, 3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 855#L983-1true, 125#L1023-1true, 6311#true, 3594#true, 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:15,466 INFO L294 olderBase$Statistics]: this new event has 1280 ancestors and is cut-off event [2025-03-15 01:27:15,466 INFO L297 olderBase$Statistics]: existing Event has 1171 ancestors and is cut-off event [2025-03-15 01:27:15,466 INFO L297 olderBase$Statistics]: existing Event has 1190 ancestors and is cut-off event [2025-03-15 01:27:15,466 INFO L297 olderBase$Statistics]: existing Event has 1208 ancestors and is cut-off event [2025-03-15 01:27:15,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [3561#true, 26456#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 155#L983-2true, 125#L1023-1true, 6311#true, 3582#true, 3594#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:15,635 INFO L294 olderBase$Statistics]: this new event has 1281 ancestors and is cut-off event [2025-03-15 01:27:15,635 INFO L297 olderBase$Statistics]: existing Event has 1191 ancestors and is cut-off event [2025-03-15 01:27:15,635 INFO L297 olderBase$Statistics]: existing Event has 1172 ancestors and is cut-off event [2025-03-15 01:27:15,635 INFO L297 olderBase$Statistics]: existing Event has 1209 ancestors and is cut-off event [2025-03-15 01:27:15,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [408#L983-3true, 3561#true, 26456#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 14519#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 125#L1023-1true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:15,854 INFO L294 olderBase$Statistics]: this new event has 1282 ancestors and is cut-off event [2025-03-15 01:27:15,854 INFO L297 olderBase$Statistics]: existing Event has 1173 ancestors and is cut-off event [2025-03-15 01:27:15,854 INFO L297 olderBase$Statistics]: existing Event has 1210 ancestors and is cut-off event [2025-03-15 01:27:15,854 INFO L297 olderBase$Statistics]: existing Event has 1192 ancestors and is cut-off event [2025-03-15 01:27:16,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [3561#true, 26456#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 125#L1023-1true, 3594#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 156#L983-5true, 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:16,183 INFO L294 olderBase$Statistics]: this new event has 1284 ancestors and is cut-off event [2025-03-15 01:27:16,183 INFO L297 olderBase$Statistics]: existing Event has 1194 ancestors and is cut-off event [2025-03-15 01:27:16,183 INFO L297 olderBase$Statistics]: existing Event has 1212 ancestors and is cut-off event [2025-03-15 01:27:16,183 INFO L297 olderBase$Statistics]: existing Event has 1175 ancestors and is cut-off event [2025-03-15 01:27:16,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][3116], [26456#true, 3561#true, 980#true, 974#true, 17434#(< ~top~0 2147483648), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14#L1010-4true, t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 14519#true, t2Thread1of1ForFork0InUse, 125#L1023-1true, 6311#true, 3582#true, 3594#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:16,617 INFO L294 olderBase$Statistics]: this new event has 1287 ancestors and is cut-off event [2025-03-15 01:27:16,617 INFO L297 olderBase$Statistics]: existing Event has 1178 ancestors and is cut-off event [2025-03-15 01:27:16,617 INFO L297 olderBase$Statistics]: existing Event has 1215 ancestors and is cut-off event [2025-03-15 01:27:16,617 INFO L297 olderBase$Statistics]: existing Event has 1197 ancestors and is cut-off event [2025-03-15 01:27:17,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2093] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][3296], [3561#true, 980#true, 17434#(< ~top~0 2147483648), 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t1Thread1of1ForFork1InUse, 3567#true, 3573#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 15#L1022-4true, 611#L1013-2true, 43856#(< ~top~0 2147483646), 3576#true, 51867#(< ~top~0 2147483644), 26456#true, 248#L1000true, 974#true, 14519#true, 3594#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:27:17,174 INFO L294 olderBase$Statistics]: this new event has 1287 ancestors and is cut-off event [2025-03-15 01:27:17,174 INFO L297 olderBase$Statistics]: existing Event has 1178 ancestors and is cut-off event [2025-03-15 01:27:17,174 INFO L297 olderBase$Statistics]: existing Event has 1197 ancestors and is cut-off event [2025-03-15 01:27:17,174 INFO L297 olderBase$Statistics]: existing Event has 1215 ancestors and is cut-off event [2025-03-15 01:27:32,978 INFO L124 PetriNetUnfolderBase]: 8432/55722 cut-off events. [2025-03-15 01:27:32,978 INFO L125 PetriNetUnfolderBase]: For 2049763/2122388 co-relation queries the response was YES. [2025-03-15 01:27:33,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368877 conditions, 55722 events. 8432/55722 cut-off events. For 2049763/2122388 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 637843 event pairs, 1397 based on Foata normal form. 563/51135 useless extension candidates. Maximal degree in co-relation 350975. Up to 17332 conditions per place. [2025-03-15 01:27:33,644 INFO L140 encePairwiseOnDemand]: 960/974 looper letters, 3831 selfloop transitions, 680 changer transitions 1411/6842 dead transitions. [2025-03-15 01:27:33,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1276 places, 6842 transitions, 217571 flow [2025-03-15 01:27:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-15 01:27:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-15 01:27:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 58745 transitions. [2025-03-15 01:27:33,703 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9573514552980672 [2025-03-15 01:27:33,705 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 305 predicate places. [2025-03-15 01:27:33,706 INFO L471 AbstractCegarLoop]: Abstraction has has 1276 places, 6842 transitions, 217571 flow [2025-03-15 01:27:33,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 931.5) internal successors, (31671), 34 states have internal predecessors, (31671), 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-15 01:27:33,710 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:33,712 INFO L221 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:27:33,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-15 01:27:33,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:33,912 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1368693464, now seen corresponding path program 3 times [2025-03-15 01:27:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443466849] [2025-03-15 01:27:33,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:34,411 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-15 01:27:34,411 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 586 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443466849] [2025-03-15 01:27:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443466849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241021549] [2025-03-15 01:27:38,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:38,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:38,703 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:27:38,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 01:27:40,498 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-15 01:27:40,498 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:40,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 2536 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-15 01:27:40,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 586 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:41,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 586 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:42,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241021549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:42,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:42,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17, 17] total 45 [2025-03-15 01:27:42,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330681419] [2025-03-15 01:27:42,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:42,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-15 01:27:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:42,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-15 01:27:42,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1645, Unknown=0, NotChecked=0, Total=2070 [2025-03-15 01:27:42,244 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 925 out of 974 [2025-03-15 01:27:42,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1276 places, 6842 transitions, 217571 flow. Second operand has 46 states, 46 states have (on average 932.2391304347826) internal successors, (42883), 46 states have internal predecessors, (42883), 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-15 01:27:42,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:42,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 925 of 974 [2025-03-15 01:27:42,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:28:26,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2060] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3431], [20186#(<= 1 ~top~0), 3561#true, 980#true, 3598#(<= 1 ~top~0), 17571#(< ~top~0 2147483647), 3578#(<= 1 ~top~0), 14521#(<= |t1Thread1of1ForFork1_~i~0#1| 799), 3573#true, 3567#true, t1Thread1of1ForFork1InUse, t2Thread1of1ForFork0InUse, 3582#true, 60055#(< ~top~0 2147483641), 648#L998-2true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 15#L1022-4true, 9172#(< ~top~0 2147483646), 30329#(< ~top~0 2147483645), 52391#(< ~top~0 2147483642), 752#L1005-7true, 44779#(< ~top~0 2147483641), 974#true, 23831#(< ~top~0 2147483645), 37433#(< ~top~0 2147483641), 3554#true]) [2025-03-15 01:28:26,354 INFO L294 olderBase$Statistics]: this new event has 1219 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L297 olderBase$Statistics]: existing Event has 1193 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L297 olderBase$Statistics]: existing Event has 1166 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L297 olderBase$Statistics]: existing Event has 1211 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2060] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3431], [3561#true, 20186#(<= 1 ~top~0), 980#true, 3598#(<= 1 ~top~0), 3578#(<= 1 ~top~0), 17571#(< ~top~0 2147483647), 14521#(<= |t1Thread1of1ForFork1_~i~0#1| 799), 3573#true, t1Thread1of1ForFork1InUse, 3567#true, t2Thread1of1ForFork0InUse, 3582#true, 60055#(< ~top~0 2147483641), 648#L998-2true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 15#L1022-4true, 9172#(< ~top~0 2147483646), 30329#(< ~top~0 2147483645), 52391#(< ~top~0 2147483642), 44779#(< ~top~0 2147483641), 974#true, 23831#(< ~top~0 2147483645), 626#L1015true, 37433#(< ~top~0 2147483641), 3554#true]) [2025-03-15 01:28:26,354 INFO L294 olderBase$Statistics]: this new event has 1220 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L297 olderBase$Statistics]: existing Event has 1194 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L297 olderBase$Statistics]: existing Event has 1167 ancestors and is cut-off event [2025-03-15 01:28:26,354 INFO L297 olderBase$Statistics]: existing Event has 1212 ancestors and is cut-off event [2025-03-15 01:28:40,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2060] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3430], [20186#(<= 1 ~top~0), 3561#true, 980#true, 3598#(<= 1 ~top~0), 3578#(<= 1 ~top~0), 17571#(< ~top~0 2147483647), 14521#(<= |t1Thread1of1ForFork1_~i~0#1| 799), 3573#true, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t1Thread1of1ForFork1InUse, t2Thread1of1ForFork0InUse, 3582#true, 60055#(< ~top~0 2147483641), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 648#L998-2true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 15#L1022-4true, 9172#(< ~top~0 2147483646), 30329#(< ~top~0 2147483645), 52391#(< ~top~0 2147483642), 44779#(< ~top~0 2147483641), 974#true, 23831#(< ~top~0 2147483645), 37433#(< ~top~0 2147483641), 17#L1007true]) [2025-03-15 01:28:40,484 INFO L294 olderBase$Statistics]: this new event has 1257 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1194 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1167 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1212 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2060] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3431], [20186#(<= 1 ~top~0), 3561#true, 980#true, 3598#(<= 1 ~top~0), 3578#(<= 1 ~top~0), 17571#(< ~top~0 2147483647), 14521#(<= |t1Thread1of1ForFork1_~i~0#1| 799), 3567#true, t1Thread1of1ForFork1InUse, 3573#true, t2Thread1of1ForFork0InUse, 3582#true, 60055#(< ~top~0 2147483641), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 648#L998-2true, 15#L1022-4true, 9172#(< ~top~0 2147483646), 30329#(< ~top~0 2147483645), 752#L1005-7true, 52391#(< ~top~0 2147483642), 44779#(< ~top~0 2147483641), 974#true, 23831#(< ~top~0 2147483645), 37433#(< ~top~0 2147483641), 3554#true]) [2025-03-15 01:28:40,484 INFO L294 olderBase$Statistics]: this new event has 1256 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1219 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1193 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1166 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1211 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2060] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3431], [20186#(<= 1 ~top~0), 3561#true, 980#true, 3598#(<= 1 ~top~0), 3578#(<= 1 ~top~0), 17571#(< ~top~0 2147483647), 14521#(<= |t1Thread1of1ForFork1_~i~0#1| 799), 3573#true, 3567#true, t1Thread1of1ForFork1InUse, t2Thread1of1ForFork0InUse, 3582#true, 60055#(< ~top~0 2147483641), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 648#L998-2true, 15#L1022-4true, 9172#(< ~top~0 2147483646), 30329#(< ~top~0 2147483645), 52391#(< ~top~0 2147483642), 44779#(< ~top~0 2147483641), 974#true, 626#L1015true, 23831#(< ~top~0 2147483645), 37433#(< ~top~0 2147483641), 3554#true]) [2025-03-15 01:28:40,484 INFO L294 olderBase$Statistics]: this new event has 1257 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1194 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1220 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1167 ancestors and is cut-off event [2025-03-15 01:28:40,484 INFO L297 olderBase$Statistics]: existing Event has 1212 ancestors and is cut-off event [2025-03-15 01:29:47,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9276], [33185#(and (<= ~top~0 2147483644) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483645)), 3561#true, 980#true, t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 40054#true, 974#true, 20173#(and (<= ~top~0 2147483647) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483648)), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 3579#(<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|), 772#L949-4true, 55023#(and (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483644) (<= ~top~0 2147483643)), 26441#(and (<= ~top~0 2147483646) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483647)), 20197#(and (<= 0 ~top~0) (<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|)), 55064#true, 33202#true]) [2025-03-15 01:29:47,293 INFO L294 olderBase$Statistics]: this new event has 1404 ancestors and is cut-off event [2025-03-15 01:29:47,293 INFO L297 olderBase$Statistics]: existing Event has 1367 ancestors and is cut-off event [2025-03-15 01:29:47,293 INFO L297 olderBase$Statistics]: existing Event has 1367 ancestors and is cut-off event [2025-03-15 01:29:47,293 INFO L297 olderBase$Statistics]: existing Event has 1367 ancestors and is cut-off event [2025-03-15 01:29:47,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 30329#(< ~top~0 2147483645), 3576#true, 51867#(< ~top~0 2147483644), 40054#true, 202#L947true, 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:47,623 INFO L294 olderBase$Statistics]: this new event has 1405 ancestors and is cut-off event [2025-03-15 01:29:47,623 INFO L297 olderBase$Statistics]: existing Event has 1368 ancestors and is cut-off event [2025-03-15 01:29:47,623 INFO L297 olderBase$Statistics]: existing Event has 1368 ancestors and is cut-off event [2025-03-15 01:29:47,623 INFO L297 olderBase$Statistics]: existing Event has 1368 ancestors and is cut-off event [2025-03-15 01:29:47,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 30329#(< ~top~0 2147483645), 3576#true, 51867#(< ~top~0 2147483644), 40054#true, 596#L983true, 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:47,971 INFO L294 olderBase$Statistics]: this new event has 1406 ancestors and is cut-off event [2025-03-15 01:29:47,971 INFO L297 olderBase$Statistics]: existing Event has 1369 ancestors and is cut-off event [2025-03-15 01:29:47,971 INFO L297 olderBase$Statistics]: existing Event has 1369 ancestors and is cut-off event [2025-03-15 01:29:47,971 INFO L297 olderBase$Statistics]: existing Event has 1369 ancestors and is cut-off event [2025-03-15 01:29:48,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), 312#L953true, t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3576#true, 30329#(< ~top~0 2147483645), 40054#true, 51867#(< ~top~0 2147483644), 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:48,280 INFO L294 olderBase$Statistics]: this new event has 1407 ancestors and is cut-off event [2025-03-15 01:29:48,280 INFO L297 olderBase$Statistics]: existing Event has 1370 ancestors and is cut-off event [2025-03-15 01:29:48,280 INFO L297 olderBase$Statistics]: existing Event has 1370 ancestors and is cut-off event [2025-03-15 01:29:48,280 INFO L297 olderBase$Statistics]: existing Event has 1370 ancestors and is cut-off event [2025-03-15 01:29:48,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 30329#(< ~top~0 2147483645), 3576#true, 40054#true, 51867#(< ~top~0 2147483644), 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 12#get_top_returnLabel#1true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:48,611 INFO L294 olderBase$Statistics]: this new event has 1408 ancestors and is cut-off event [2025-03-15 01:29:48,611 INFO L297 olderBase$Statistics]: existing Event has 1371 ancestors and is cut-off event [2025-03-15 01:29:48,611 INFO L297 olderBase$Statistics]: existing Event has 1371 ancestors and is cut-off event [2025-03-15 01:29:48,611 INFO L297 olderBase$Statistics]: existing Event has 1371 ancestors and is cut-off event [2025-03-15 01:29:48,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 30329#(< ~top~0 2147483645), 3576#true, 51867#(< ~top~0 2147483644), 40054#true, 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 855#L983-1true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:48,941 INFO L294 olderBase$Statistics]: this new event has 1409 ancestors and is cut-off event [2025-03-15 01:29:48,941 INFO L297 olderBase$Statistics]: existing Event has 1372 ancestors and is cut-off event [2025-03-15 01:29:48,941 INFO L297 olderBase$Statistics]: existing Event has 1372 ancestors and is cut-off event [2025-03-15 01:29:48,941 INFO L297 olderBase$Statistics]: existing Event has 1372 ancestors and is cut-off event [2025-03-15 01:29:49,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 155#L983-2true, 3582#true, 6311#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 3576#true, 30329#(< ~top~0 2147483645), 51867#(< ~top~0 2147483644), 40054#true, 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:49,210 INFO L294 olderBase$Statistics]: this new event has 1410 ancestors and is cut-off event [2025-03-15 01:29:49,210 INFO L297 olderBase$Statistics]: existing Event has 1373 ancestors and is cut-off event [2025-03-15 01:29:49,210 INFO L297 olderBase$Statistics]: existing Event has 1373 ancestors and is cut-off event [2025-03-15 01:29:49,210 INFO L297 olderBase$Statistics]: existing Event has 1373 ancestors and is cut-off event [2025-03-15 01:29:49,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [408#L983-3true, 3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 30329#(< ~top~0 2147483645), 3576#true, 51867#(< ~top~0 2147483644), 40054#true, 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:49,491 INFO L294 olderBase$Statistics]: this new event has 1411 ancestors and is cut-off event [2025-03-15 01:29:49,491 INFO L297 olderBase$Statistics]: existing Event has 1374 ancestors and is cut-off event [2025-03-15 01:29:49,491 INFO L297 olderBase$Statistics]: existing Event has 1374 ancestors and is cut-off event [2025-03-15 01:29:49,491 INFO L297 olderBase$Statistics]: existing Event has 1374 ancestors and is cut-off event [2025-03-15 01:29:50,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 156#L983-5true, 30329#(< ~top~0 2147483645), 3576#true, 40054#true, 51867#(< ~top~0 2147483644), 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:50,399 INFO L294 olderBase$Statistics]: this new event has 1413 ancestors and is cut-off event [2025-03-15 01:29:50,399 INFO L297 olderBase$Statistics]: existing Event has 1376 ancestors and is cut-off event [2025-03-15 01:29:50,399 INFO L297 olderBase$Statistics]: existing Event has 1376 ancestors and is cut-off event [2025-03-15 01:29:50,399 INFO L297 olderBase$Statistics]: existing Event has 1376 ancestors and is cut-off event [2025-03-15 01:29:51,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][9307], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 3576#true, 30329#(< ~top~0 2147483645), 40054#true, 51867#(< ~top~0 2147483644), 974#true, 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14#L1010-4true, 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:51,547 INFO L294 olderBase$Statistics]: this new event has 1416 ancestors and is cut-off event [2025-03-15 01:29:51,547 INFO L297 olderBase$Statistics]: existing Event has 1379 ancestors and is cut-off event [2025-03-15 01:29:51,547 INFO L297 olderBase$Statistics]: existing Event has 1379 ancestors and is cut-off event [2025-03-15 01:29:51,547 INFO L297 olderBase$Statistics]: existing Event has 1379 ancestors and is cut-off event [2025-03-15 01:29:53,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2093] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][9734], [3561#true, 322#L991-7true, 980#true, 17434#(< ~top~0 2147483648), 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3573#true, t1Thread1of1ForFork1InUse, 3567#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 15#L1022-4true, 611#L1013-2true, 30329#(< ~top~0 2147483645), 3576#true, 40054#true, 51867#(< ~top~0 2147483644), 974#true, 14519#true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:53,209 INFO L294 olderBase$Statistics]: this new event has 1415 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L297 olderBase$Statistics]: existing Event has 1378 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L297 olderBase$Statistics]: existing Event has 1378 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L297 olderBase$Statistics]: existing Event has 1378 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2093] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][9734], [3561#true, 980#true, 17434#(< ~top~0 2147483648), 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, 3573#true, t1Thread1of1ForFork1InUse, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 15#L1022-4true, 611#L1013-2true, 30329#(< ~top~0 2147483645), 3576#true, 40054#true, 51867#(< ~top~0 2147483644), 248#L1000true, 974#true, 14519#true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:29:53,209 INFO L294 olderBase$Statistics]: this new event has 1416 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L297 olderBase$Statistics]: existing Event has 1379 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L297 olderBase$Statistics]: existing Event has 1379 ancestors and is cut-off event [2025-03-15 01:29:53,209 INFO L297 olderBase$Statistics]: existing Event has 1379 ancestors and is cut-off event [2025-03-15 01:30:15,521 INFO L124 PetriNetUnfolderBase]: 14901/98606 cut-off events. [2025-03-15 01:30:15,522 INFO L125 PetriNetUnfolderBase]: For 3959887/4098174 co-relation queries the response was YES. [2025-03-15 01:30:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695226 conditions, 98606 events. 14901/98606 cut-off events. For 3959887/4098174 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 1268300 event pairs, 2497 based on Foata normal form. 775/90292 useless extension candidates. Maximal degree in co-relation 669543. Up to 31418 conditions per place. [2025-03-15 01:30:16,966 INFO L140 encePairwiseOnDemand]: 960/974 looper letters, 7043 selfloop transitions, 1256 changer transitions 2507/11763 dead transitions. [2025-03-15 01:30:16,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1349 places, 11763 transitions, 408977 flow [2025-03-15 01:30:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-15 01:30:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-03-15 01:30:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 68994 transitions. [2025-03-15 01:30:17,057 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9572395804428658 [2025-03-15 01:30:17,058 INFO L298 CegarLoopForPetriNet]: 971 programPoint places, 378 predicate places. [2025-03-15 01:30:17,058 INFO L471 AbstractCegarLoop]: Abstraction has has 1349 places, 11763 transitions, 408977 flow [2025-03-15 01:30:17,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 932.2391304347826) internal successors, (42883), 46 states have internal predecessors, (42883), 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-15 01:30:17,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:30:17,066 INFO L221 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:30:17,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-15 01:30:17,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 01:30:17,267 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:30:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:30:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash 182312006, now seen corresponding path program 4 times [2025-03-15 01:30:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:30:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335629083] [2025-03-15 01:30:17,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:30:17,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:30:17,351 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:30:17,351 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:30:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 669 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:30:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:30:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335629083] [2025-03-15 01:30:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335629083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:30:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24624068] [2025-03-15 01:30:20,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:30:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:30:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:30:20,946 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:30:20,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 01:30:21,771 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:30:21,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:30:21,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-15 01:30:21,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:30:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 669 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:30:22,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:30:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 669 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:30:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24624068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:30:24,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:30:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 43 [2025-03-15 01:30:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701693461] [2025-03-15 01:30:24,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:30:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-15 01:30:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:30:24,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-15 01:30:24,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1492, Unknown=0, NotChecked=0, Total=1892 [2025-03-15 01:30:24,156 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 925 out of 974 [2025-03-15 01:30:24,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1349 places, 11763 transitions, 408977 flow. Second operand has 44 states, 44 states have (on average 933.5681818181819) internal successors, (41077), 44 states have internal predecessors, (41077), 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-15 01:30:24,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:30:24,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 925 of 974 [2025-03-15 01:30:24,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:35:42,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7594], [3561#true, 980#true, t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 47401#(and (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483646) (<= ~top~0 2147483645)), 47444#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 26456#true, 71627#(and (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483643) (<= ~top~0 2147483642)), 974#true, 20173#(and (<= ~top~0 2147483647) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483648)), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 3579#(<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|), 772#L949-4true, 26441#(and (<= ~top~0 2147483646) (<= |t2Thread1of1ForFork0_dec_top_#t~post32#1| 2147483647)), 20197#(and (<= 0 ~top~0) (<= 1 |t2Thread1of1ForFork0_dec_top_#t~post32#1|)), 55064#true, 33202#true]) [2025-03-15 01:35:42,488 INFO L294 olderBase$Statistics]: this new event has 1410 ancestors and is cut-off event [2025-03-15 01:35:42,488 INFO L297 olderBase$Statistics]: existing Event has 1365 ancestors and is cut-off event [2025-03-15 01:35:42,488 INFO L297 olderBase$Statistics]: existing Event has 1301 ancestors and is cut-off event [2025-03-15 01:35:42,488 INFO L297 olderBase$Statistics]: existing Event has 1338 ancestors and is cut-off event [2025-03-15 01:35:43,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 47444#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 43856#(< ~top~0 2147483646), 3576#true, 202#L947true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:43,809 INFO L294 olderBase$Statistics]: this new event has 1411 ancestors and is cut-off event [2025-03-15 01:35:43,809 INFO L297 olderBase$Statistics]: existing Event has 1366 ancestors and is cut-off event [2025-03-15 01:35:43,809 INFO L297 olderBase$Statistics]: existing Event has 1339 ancestors and is cut-off event [2025-03-15 01:35:43,809 INFO L297 olderBase$Statistics]: existing Event has 1302 ancestors and is cut-off event [2025-03-15 01:35:45,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 47444#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 596#L983true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:45,124 INFO L294 olderBase$Statistics]: this new event has 1412 ancestors and is cut-off event [2025-03-15 01:35:45,124 INFO L297 olderBase$Statistics]: existing Event has 1367 ancestors and is cut-off event [2025-03-15 01:35:45,124 INFO L297 olderBase$Statistics]: existing Event has 1340 ancestors and is cut-off event [2025-03-15 01:35:45,124 INFO L297 olderBase$Statistics]: existing Event has 1303 ancestors and is cut-off event [2025-03-15 01:35:46,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), 312#L953true, t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 47444#true, 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:46,545 INFO L294 olderBase$Statistics]: this new event has 1413 ancestors and is cut-off event [2025-03-15 01:35:46,545 INFO L297 olderBase$Statistics]: existing Event has 1341 ancestors and is cut-off event [2025-03-15 01:35:46,545 INFO L297 olderBase$Statistics]: existing Event has 1368 ancestors and is cut-off event [2025-03-15 01:35:46,545 INFO L297 olderBase$Statistics]: existing Event has 1304 ancestors and is cut-off event [2025-03-15 01:35:47,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 47444#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 12#get_top_returnLabel#1true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:47,973 INFO L294 olderBase$Statistics]: this new event has 1414 ancestors and is cut-off event [2025-03-15 01:35:47,973 INFO L297 olderBase$Statistics]: existing Event has 1369 ancestors and is cut-off event [2025-03-15 01:35:47,973 INFO L297 olderBase$Statistics]: existing Event has 1305 ancestors and is cut-off event [2025-03-15 01:35:47,973 INFO L297 olderBase$Statistics]: existing Event has 1342 ancestors and is cut-off event [2025-03-15 01:35:49,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 47444#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 855#L983-1true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:49,202 INFO L294 olderBase$Statistics]: this new event has 1415 ancestors and is cut-off event [2025-03-15 01:35:49,202 INFO L297 olderBase$Statistics]: existing Event has 1343 ancestors and is cut-off event [2025-03-15 01:35:49,202 INFO L297 olderBase$Statistics]: existing Event has 1370 ancestors and is cut-off event [2025-03-15 01:35:49,202 INFO L297 olderBase$Statistics]: existing Event has 1306 ancestors and is cut-off event [2025-03-15 01:35:50,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3567#true, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 155#L983-2true, 3582#true, 6311#true, 47444#true, 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:50,368 INFO L294 olderBase$Statistics]: this new event has 1416 ancestors and is cut-off event [2025-03-15 01:35:50,368 INFO L297 olderBase$Statistics]: existing Event has 1371 ancestors and is cut-off event [2025-03-15 01:35:50,368 INFO L297 olderBase$Statistics]: existing Event has 1307 ancestors and is cut-off event [2025-03-15 01:35:50,368 INFO L297 olderBase$Statistics]: existing Event has 1344 ancestors and is cut-off event [2025-03-15 01:35:51,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [408#L983-3true, 3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 47444#true, 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:51,811 INFO L294 olderBase$Statistics]: this new event has 1417 ancestors and is cut-off event [2025-03-15 01:35:51,811 INFO L297 olderBase$Statistics]: existing Event has 1345 ancestors and is cut-off event [2025-03-15 01:35:51,811 INFO L297 olderBase$Statistics]: existing Event has 1372 ancestors and is cut-off event [2025-03-15 01:35:51,811 INFO L297 olderBase$Statistics]: existing Event has 1308 ancestors and is cut-off event [2025-03-15 01:35:54,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 3582#true, 6311#true, 47444#true, 20188#(<= 0 ~top~0), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 156#L983-5true, 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:54,704 INFO L294 olderBase$Statistics]: this new event has 1419 ancestors and is cut-off event [2025-03-15 01:35:54,704 INFO L297 olderBase$Statistics]: existing Event has 1310 ancestors and is cut-off event [2025-03-15 01:35:54,704 INFO L297 olderBase$Statistics]: existing Event has 1374 ancestors and is cut-off event [2025-03-15 01:35:54,704 INFO L297 olderBase$Statistics]: existing Event has 1347 ancestors and is cut-off event [2025-03-15 01:35:59,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2146] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][7660], [3561#true, 980#true, 17434#(< ~top~0 2147483648), t1Thread1of1ForFork1NotInUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), 3567#true, t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 47444#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 974#true, 68069#(< ~top~0 2147483643), 3575#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 14#L1010-4true, 14519#true, 125#L1023-1true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:35:59,703 INFO L294 olderBase$Statistics]: this new event has 1422 ancestors and is cut-off event [2025-03-15 01:35:59,703 INFO L297 olderBase$Statistics]: existing Event has 1350 ancestors and is cut-off event [2025-03-15 01:35:59,703 INFO L297 olderBase$Statistics]: existing Event has 1377 ancestors and is cut-off event [2025-03-15 01:35:59,703 INFO L297 olderBase$Statistics]: existing Event has 1313 ancestors and is cut-off event [2025-03-15 01:36:05,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2093] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][8151], [3561#true, 980#true, 17434#(< ~top~0 2147483648), 3567#true, 3573#true, t1Thread1of1ForFork1InUse, 3556#(<= |t2Thread1of1ForFork0_~i~1#1| 799), t2Thread1of1ForFork0InUse, 6311#true, 3582#true, 47444#true, 3525#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 11761#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 20188#(<= 0 ~top~0), 15#L1022-4true, 611#L1013-2true, 43856#(< ~top~0 2147483646), 3576#true, 26456#true, 248#L1000true, 974#true, 68069#(< ~top~0 2147483643), 14519#true, 3594#true, 55064#true, 33202#true, 23318#(< ~top~0 2147483647)]) [2025-03-15 01:36:05,992 INFO L294 olderBase$Statistics]: this new event has 1422 ancestors and is cut-off event [2025-03-15 01:36:05,992 INFO L297 olderBase$Statistics]: existing Event has 1313 ancestors and is cut-off event [2025-03-15 01:36:05,992 INFO L297 olderBase$Statistics]: existing Event has 1350 ancestors and is cut-off event [2025-03-15 01:36:05,992 INFO L297 olderBase$Statistics]: existing Event has 1377 ancestors and is cut-off event Received shutdown request... [2025-03-15 01:37:35,602 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:37:35,602 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:37:36,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2025-03-15 01:37:36,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-15 01:37:36,827 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-15 01:37:36,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:37:36,828 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:37:36,830 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:37:36,836 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:37:36,836 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:37:36,836 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:37:36,836 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:37:36,836 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:37:36,836 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:37:36,837 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:37:36,843 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:37:36,843 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:37:36,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:37:36 BasicIcfg [2025-03-15 01:37:36,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:37:36,856 INFO L158 Benchmark]: Toolchain (without parser) took 750669.14ms. Allocated memory was 71.3MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 43.2MB in the beginning and 790.3MB in the end (delta: -747.1MB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2025-03-15 01:37:36,856 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:37:36,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.72ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 28.8MB in the end (delta: 14.3MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. [2025-03-15 01:37:36,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.37ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 37.8MB in the end (delta: -9.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2025-03-15 01:37:36,857 INFO L158 Benchmark]: Boogie Preprocessor took 78.76ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 31.8MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:37:36,857 INFO L158 Benchmark]: RCFGBuilder took 1177.15ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 31.8MB in the beginning and 36.2MB in the end (delta: -4.4MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2025-03-15 01:37:36,857 INFO L158 Benchmark]: TraceAbstraction took 748816.95ms. Allocated memory was 96.5MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 35.2MB in the beginning and 790.3MB in the end (delta: -755.0MB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2025-03-15 01:37:36,858 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.72ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 28.8MB in the end (delta: 14.3MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 111.37ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 37.8MB in the end (delta: -9.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.76ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 31.8MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1177.15ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 31.8MB in the beginning and 36.2MB in the end (delta: -4.4MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. * TraceAbstraction took 748816.95ms. Allocated memory was 96.5MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 35.2MB in the beginning and 790.3MB in the end (delta: -755.0MB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 945]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 945]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 949]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 949]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1091 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 748.6s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 702.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3503 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3503 mSDsluCounter, 1441 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1252 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5530 IncrementalHoareTripleChecker+Invalid, 5715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 189 mSDtfsCounter, 5530 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23775 GetRequests, 23180 SyntacticMatches, 1 SemanticMatches, 594 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10764 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408977occurred in iteration=21, InterpolantAutomatonStates: 422, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 34731 NumberOfCodeBlocks, 34731 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 44983 ConstructedInterpolants, 0 QuantifiedInterpolants, 116121 SizeOfPredicates, 135 NumberOfNonLiveVariables, 25722 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 43 InterpolantComputations, 13 PerfectInterpolantSequences, 132/10256 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown