/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/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:25:56,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:25:56,988 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:57,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:25:57,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:25:57,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:25:57,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:25:57,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:25:57,013 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:25:57,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:25:57,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:25:57,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:25:57,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:25:57,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:25:57,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:25:57,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:25:57,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:25:57,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:25:57,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:25:57,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:25:57,017 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:57,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:25:57,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:25:57,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:25:57,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:25:57,270 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:25:57,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2025-03-15 01:25:58,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f61016a/8f1b300b3a5242639ae86f25b6b1f1d1/FLAG2c62cc473 [2025-03-15 01:25:58,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:25:58,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2025-03-15 01:25:58,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f61016a/8f1b300b3a5242639ae86f25b6b1f1d1/FLAG2c62cc473 [2025-03-15 01:25:58,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f61016a/8f1b300b3a5242639ae86f25b6b1f1d1 [2025-03-15 01:25:58,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:25:58,716 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:25:58,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:25:58,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:25:58,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:25:58,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:25:58" (1/1) ... [2025-03-15 01:25:58,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cabd389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:58, skipping insertion in model container [2025-03-15 01:25:58,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:25:58" (1/1) ... [2025-03-15 01:25:58,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:25:58,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:25:58,982 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:25:59,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:25:59,051 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:25:59,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:59 WrapperNode [2025-03-15 01:25:59,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:25:59,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:25:59,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:25:59,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:25:59,057 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:59" (1/1) ... [2025-03-15 01:25:59,067 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:59" (1/1) ... [2025-03-15 01:25:59,081 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-15 01:25:59,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:25:59,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:25:59,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:25:59,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:25:59,087 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:59" (1/1) ... [2025-03-15 01:25:59,087 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:59" (1/1) ... [2025-03-15 01:25:59,090 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:59" (1/1) ... [2025-03-15 01:25:59,090 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:59" (1/1) ... [2025-03-15 01:25:59,094 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:59" (1/1) ... [2025-03-15 01:25:59,094 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:59" (1/1) ... [2025-03-15 01:25:59,100 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:59" (1/1) ... [2025-03-15 01:25:59,103 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:59" (1/1) ... [2025-03-15 01:25:59,103 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:59" (1/1) ... [2025-03-15 01:25:59,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:25:59,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:25:59,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:25:59,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:25:59,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:59" (1/1) ... [2025-03-15 01:25:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:25:59,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:59,137 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:59,142 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:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:25:59,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:25:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:25:59,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:25:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:25:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:25:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:25:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:25:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:25:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:25:59,176 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:59,268 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:25:59,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:25:59,380 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:25:59,380 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:25:59,410 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:25:59,410 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:25:59,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:25:59 BoogieIcfgContainer [2025-03-15 01:25:59,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:25:59,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:25:59,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:25:59,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:25:59,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:25:58" (1/3) ... [2025-03-15 01:25:59,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5731ba81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:25:59, skipping insertion in model container [2025-03-15 01:25:59,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:59" (2/3) ... [2025-03-15 01:25:59,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5731ba81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:25:59, skipping insertion in model container [2025-03-15 01:25:59,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:25:59" (3/3) ... [2025-03-15 01:25:59,420 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-03-15 01:25:59,430 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:25:59,432 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 74 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:25:59,432 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:25:59,489 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:25:59,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:25:59,535 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;@9a930af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:25:59,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:25:59,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:25:59,559 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-15 01:25:59,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:25:59,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:59,565 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] [2025-03-15 01:25:59,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:59,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772315, now seen corresponding path program 1 times [2025-03-15 01:25:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015966164] [2025-03-15 01:25:59,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:59,755 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:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015966164] [2025-03-15 01:25:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015966164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:59,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:59,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:25:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356253842] [2025-03-15 01:25:59,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:59,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:59,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:59,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:59,779 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:25:59,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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:59,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:59,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:25:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:59,889 INFO L124 PetriNetUnfolderBase]: 90/374 cut-off events. [2025-03-15 01:25:59,889 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:25:59,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 374 events. 90/374 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2147 event pairs, 23 based on Foata normal form. 44/301 useless extension candidates. Maximal degree in co-relation 497. Up to 69 conditions per place. [2025-03-15 01:25:59,899 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 13 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-15 01:25:59,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 192 flow [2025-03-15 01:25:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:25:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:25:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-15 01:25:59,909 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2025-03-15 01:25:59,912 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-03-15 01:25:59,912 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 192 flow [2025-03-15 01:25:59,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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:59,913 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:59,913 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] [2025-03-15 01:25:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:25:59,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772316, now seen corresponding path program 1 times [2025-03-15 01:25:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81805770] [2025-03-15 01:25:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:59,969 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:59,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81805770] [2025-03-15 01:25:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81805770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:59,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:59,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:25:59,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16994305] [2025-03-15 01:25:59,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:59,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:59,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:59,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:59,972 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:25:59,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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:59,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:59,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:25:59,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:00,039 INFO L124 PetriNetUnfolderBase]: 75/359 cut-off events. [2025-03-15 01:26:00,039 INFO L125 PetriNetUnfolderBase]: For 33/55 co-relation queries the response was YES. [2025-03-15 01:26:00,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 359 events. 75/359 cut-off events. For 33/55 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1874 event pairs, 10 based on Foata normal form. 6/261 useless extension candidates. Maximal degree in co-relation 591. Up to 76 conditions per place. [2025-03-15 01:26:00,042 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 19 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-15 01:26:00,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 266 flow [2025-03-15 01:26:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-03-15 01:26:00,044 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9004329004329005 [2025-03-15 01:26:00,044 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2025-03-15 01:26:00,045 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 266 flow [2025-03-15 01:26:00,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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:00,045 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:00,045 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] [2025-03-15 01:26:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:26:00,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807743, now seen corresponding path program 1 times [2025-03-15 01:26:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805353328] [2025-03-15 01:26:00,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:00,141 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:26:00,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805353328] [2025-03-15 01:26:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805353328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:00,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696713607] [2025-03-15 01:26:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:00,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:00,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:00,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:00,143 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:00,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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:00,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:00,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:00,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:00,312 INFO L124 PetriNetUnfolderBase]: 322/937 cut-off events. [2025-03-15 01:26:00,312 INFO L125 PetriNetUnfolderBase]: For 426/565 co-relation queries the response was YES. [2025-03-15 01:26:00,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 937 events. 322/937 cut-off events. For 426/565 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6795 event pairs, 122 based on Foata normal form. 4/604 useless extension candidates. Maximal degree in co-relation 2315. Up to 350 conditions per place. [2025-03-15 01:26:00,321 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 62 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-15 01:26:00,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 605 flow [2025-03-15 01:26:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-03-15 01:26:00,324 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825974025974026 [2025-03-15 01:26:00,325 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-03-15 01:26:00,325 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 121 transitions, 605 flow [2025-03-15 01:26:00,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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:00,325 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:00,325 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] [2025-03-15 01:26:00,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:26:00,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:00,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875667, now seen corresponding path program 1 times [2025-03-15 01:26:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594829464] [2025-03-15 01:26:00,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:00,390 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:26:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594829464] [2025-03-15 01:26:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594829464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677621445] [2025-03-15 01:26:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:00,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:00,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:00,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:00,392 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:00,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 121 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:00,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:00,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:00,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:00,505 INFO L124 PetriNetUnfolderBase]: 481/1386 cut-off events. [2025-03-15 01:26:00,506 INFO L125 PetriNetUnfolderBase]: For 1262/1491 co-relation queries the response was YES. [2025-03-15 01:26:00,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 1386 events. 481/1386 cut-off events. For 1262/1491 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11433 event pairs, 89 based on Foata normal form. 15/939 useless extension candidates. Maximal degree in co-relation 3913. Up to 546 conditions per place. [2025-03-15 01:26:00,518 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:26:00,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 837 flow [2025-03-15 01:26:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-15 01:26:00,519 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-15 01:26:00,520 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2025-03-15 01:26:00,520 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 134 transitions, 837 flow [2025-03-15 01:26:00,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:00,520 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:00,520 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] [2025-03-15 01:26:00,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:26:00,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:00,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875666, now seen corresponding path program 1 times [2025-03-15 01:26:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:00,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136949597] [2025-03-15 01:26:00,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:00,573 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:26:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136949597] [2025-03-15 01:26:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136949597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518063390] [2025-03-15 01:26:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:00,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:00,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:00,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:00,575 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:00,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 134 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:00,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:00,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:00,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:00,693 INFO L124 PetriNetUnfolderBase]: 482/1292 cut-off events. [2025-03-15 01:26:00,693 INFO L125 PetriNetUnfolderBase]: For 1928/2239 co-relation queries the response was YES. [2025-03-15 01:26:00,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1292 events. 482/1292 cut-off events. For 1928/2239 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9783 event pairs, 110 based on Foata normal form. 12/870 useless extension candidates. Maximal degree in co-relation 4229. Up to 633 conditions per place. [2025-03-15 01:26:00,701 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:26:00,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 134 transitions, 953 flow [2025-03-15 01:26:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-15 01:26:00,703 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-15 01:26:00,705 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-03-15 01:26:00,705 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 134 transitions, 953 flow [2025-03-15 01:26:00,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:00,705 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:00,706 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] [2025-03-15 01:26:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:26:00,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash 864787734, now seen corresponding path program 1 times [2025-03-15 01:26:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262387735] [2025-03-15 01:26:00,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:00,770 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:26:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262387735] [2025-03-15 01:26:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262387735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:00,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831082480] [2025-03-15 01:26:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:00,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:00,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:00,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:00,771 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:00,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 134 transitions, 953 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:00,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:00,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:00,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:01,001 INFO L124 PetriNetUnfolderBase]: 951/2226 cut-off events. [2025-03-15 01:26:01,002 INFO L125 PetriNetUnfolderBase]: For 7090/7459 co-relation queries the response was YES. [2025-03-15 01:26:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9088 conditions, 2226 events. 951/2226 cut-off events. For 7090/7459 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18426 event pairs, 244 based on Foata normal form. 30/1345 useless extension candidates. Maximal degree in co-relation 9049. Up to 998 conditions per place. [2025-03-15 01:26:01,022 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 92 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2025-03-15 01:26:01,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 160 transitions, 1397 flow [2025-03-15 01:26:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-15 01:26:01,024 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2025-03-15 01:26:01,025 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-15 01:26:01,025 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 160 transitions, 1397 flow [2025-03-15 01:26:01,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:01,026 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:01,026 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:01,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:26:01,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1597002897, now seen corresponding path program 1 times [2025-03-15 01:26:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061822117] [2025-03-15 01:26:01,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061822117] [2025-03-15 01:26:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061822117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583670665] [2025-03-15 01:26:01,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:01,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:01,124 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:26:01,126 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:26:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:01,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:26:01,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:01,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:01,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583670665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:01,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:01,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:26:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888069442] [2025-03-15 01:26:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:01,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:01,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:01,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:26:01,239 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:01,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 160 transitions, 1397 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:01,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:01,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:01,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:01,472 INFO L124 PetriNetUnfolderBase]: 920/2295 cut-off events. [2025-03-15 01:26:01,472 INFO L125 PetriNetUnfolderBase]: For 8736/9999 co-relation queries the response was YES. [2025-03-15 01:26:01,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10261 conditions, 2295 events. 920/2295 cut-off events. For 8736/9999 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19036 event pairs, 186 based on Foata normal form. 49/1502 useless extension candidates. Maximal degree in co-relation 10220. Up to 1045 conditions per place. [2025-03-15 01:26:01,496 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 103 selfloop transitions, 6 changer transitions 0/173 dead transitions. [2025-03-15 01:26:01,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 1813 flow [2025-03-15 01:26:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:26:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:26:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-03-15 01:26:01,499 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.801948051948052 [2025-03-15 01:26:01,499 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2025-03-15 01:26:01,499 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 173 transitions, 1813 flow [2025-03-15 01:26:01,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:01,500 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:01,500 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] [2025-03-15 01:26:01,507 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:26:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:01,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 88120632, now seen corresponding path program 1 times [2025-03-15 01:26:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027983996] [2025-03-15 01:26:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:01,756 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:26:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:01,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027983996] [2025-03-15 01:26:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027983996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:01,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10416301] [2025-03-15 01:26:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:01,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:01,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:01,758 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:01,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 173 transitions, 1813 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:01,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:01,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:01,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:02,022 INFO L124 PetriNetUnfolderBase]: 1196/2954 cut-off events. [2025-03-15 01:26:02,023 INFO L125 PetriNetUnfolderBase]: For 15692/17010 co-relation queries the response was YES. [2025-03-15 01:26:02,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14369 conditions, 2954 events. 1196/2954 cut-off events. For 15692/17010 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25474 event pairs, 221 based on Foata normal form. 8/1914 useless extension candidates. Maximal degree in co-relation 14324. Up to 1567 conditions per place. [2025-03-15 01:26:02,049 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 89 selfloop transitions, 44 changer transitions 0/203 dead transitions. [2025-03-15 01:26:02,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 203 transitions, 2469 flow [2025-03-15 01:26:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2025-03-15 01:26:02,050 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2025-03-15 01:26:02,050 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-15 01:26:02,050 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 203 transitions, 2469 flow [2025-03-15 01:26:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:02,051 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:02,051 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] [2025-03-15 01:26:02,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:26:02,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:02,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1521756979, now seen corresponding path program 1 times [2025-03-15 01:26:02,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:02,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077872996] [2025-03-15 01:26:02,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:02,086 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:26:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:02,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077872996] [2025-03-15 01:26:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077872996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:02,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188186689] [2025-03-15 01:26:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:02,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:02,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:02,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:02,088 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:02,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 203 transitions, 2469 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:02,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:02,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:02,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:02,347 INFO L124 PetriNetUnfolderBase]: 1125/2943 cut-off events. [2025-03-15 01:26:02,347 INFO L125 PetriNetUnfolderBase]: For 26303/27999 co-relation queries the response was YES. [2025-03-15 01:26:02,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 2943 events. 1125/2943 cut-off events. For 26303/27999 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26108 event pairs, 262 based on Foata normal form. 17/1981 useless extension candidates. Maximal degree in co-relation 15275. Up to 1522 conditions per place. [2025-03-15 01:26:02,369 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 118 selfloop transitions, 26 changer transitions 0/214 dead transitions. [2025-03-15 01:26:02,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 214 transitions, 2825 flow [2025-03-15 01:26:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2025-03-15 01:26:02,371 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8883116883116883 [2025-03-15 01:26:02,371 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:26:02,371 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 214 transitions, 2825 flow [2025-03-15 01:26:02,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:02,371 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:02,372 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] [2025-03-15 01:26:02,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:26:02,372 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:26:02,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash 499182071, now seen corresponding path program 1 times [2025-03-15 01:26:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183447632] [2025-03-15 01:26:02,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:02,413 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:26:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183447632] [2025-03-15 01:26:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183447632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036523830] [2025-03-15 01:26:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:02,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:02,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:02,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:02,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:02,415 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:02,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 214 transitions, 2825 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:02,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:02,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:02,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:02,739 INFO L124 PetriNetUnfolderBase]: 949/2572 cut-off events. [2025-03-15 01:26:02,740 INFO L125 PetriNetUnfolderBase]: For 35134/37087 co-relation queries the response was YES. [2025-03-15 01:26:02,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13991 conditions, 2572 events. 949/2572 cut-off events. For 35134/37087 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22199 event pairs, 211 based on Foata normal form. 8/1824 useless extension candidates. Maximal degree in co-relation 13938. Up to 1240 conditions per place. [2025-03-15 01:26:02,772 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 110 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-03-15 01:26:02,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 182 transitions, 2499 flow [2025-03-15 01:26:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:26:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:26:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-15 01:26:02,774 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2025-03-15 01:26:02,774 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:26:02,774 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 182 transitions, 2499 flow [2025-03-15 01:26:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:02,775 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:02,775 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] [2025-03-15 01:26:02,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:26:02,775 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:26:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash 499182072, now seen corresponding path program 1 times [2025-03-15 01:26:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120711930] [2025-03-15 01:26:02,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:02,832 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:26:02,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120711930] [2025-03-15 01:26:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120711930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923586522] [2025-03-15 01:26:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:02,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:02,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:02,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:02,834 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:02,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 182 transitions, 2499 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:02,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:02,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:02,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:03,096 INFO L124 PetriNetUnfolderBase]: 981/2688 cut-off events. [2025-03-15 01:26:03,096 INFO L125 PetriNetUnfolderBase]: For 45020/46968 co-relation queries the response was YES. [2025-03-15 01:26:03,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15665 conditions, 2688 events. 981/2688 cut-off events. For 45020/46968 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 23214 event pairs, 196 based on Foata normal form. 18/1898 useless extension candidates. Maximal degree in co-relation 15608. Up to 1360 conditions per place. [2025-03-15 01:26:03,118 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 105 selfloop transitions, 15 changer transitions 0/190 dead transitions. [2025-03-15 01:26:03,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 190 transitions, 2895 flow [2025-03-15 01:26:03,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-03-15 01:26:03,119 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8727272727272727 [2025-03-15 01:26:03,119 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 26 predicate places. [2025-03-15 01:26:03,119 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 190 transitions, 2895 flow [2025-03-15 01:26:03,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:03,120 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:03,120 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:03,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:26:03,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:03,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2032517975, now seen corresponding path program 1 times [2025-03-15 01:26:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680632676] [2025-03-15 01:26:03,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:03,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680632676] [2025-03-15 01:26:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680632676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:03,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025484671] [2025-03-15 01:26:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:03,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:03,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:03,155 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:03,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 190 transitions, 2895 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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:03,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:03,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:03,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:03,370 INFO L124 PetriNetUnfolderBase]: 974/2466 cut-off events. [2025-03-15 01:26:03,371 INFO L125 PetriNetUnfolderBase]: For 57344/64031 co-relation queries the response was YES. [2025-03-15 01:26:03,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16686 conditions, 2466 events. 974/2466 cut-off events. For 57344/64031 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20963 event pairs, 135 based on Foata normal form. 496/2238 useless extension candidates. Maximal degree in co-relation 16627. Up to 1326 conditions per place. [2025-03-15 01:26:03,394 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 120 selfloop transitions, 8 changer transitions 0/207 dead transitions. [2025-03-15 01:26:03,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 3583 flow [2025-03-15 01:26:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2025-03-15 01:26:03,396 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-03-15 01:26:03,396 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-03-15 01:26:03,396 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 207 transitions, 3583 flow [2025-03-15 01:26:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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:03,396 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:03,397 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:03,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:26:03,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:03,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1888720087, now seen corresponding path program 1 times [2025-03-15 01:26:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172519434] [2025-03-15 01:26:03,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172519434] [2025-03-15 01:26:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172519434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667181609] [2025-03-15 01:26:03,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:03,464 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:26:03,465 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:26:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:03,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:26:03,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:03,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667181609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:03,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:03,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:26:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887873672] [2025-03-15 01:26:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:26:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:03,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:26:03,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:26:03,566 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:03,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 207 transitions, 3583 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 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:03,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:03,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:03,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:03,833 INFO L124 PetriNetUnfolderBase]: 889/2559 cut-off events. [2025-03-15 01:26:03,833 INFO L125 PetriNetUnfolderBase]: For 41390/44817 co-relation queries the response was YES. [2025-03-15 01:26:03,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17326 conditions, 2559 events. 889/2559 cut-off events. For 41390/44817 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 22255 event pairs, 88 based on Foata normal form. 146/2109 useless extension candidates. Maximal degree in co-relation 17265. Up to 1263 conditions per place. [2025-03-15 01:26:03,862 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 138 selfloop transitions, 7 changer transitions 0/222 dead transitions. [2025-03-15 01:26:03,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 4285 flow [2025-03-15 01:26:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:26:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:26:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2025-03-15 01:26:03,864 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2025-03-15 01:26:03,865 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 34 predicate places. [2025-03-15 01:26:03,865 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 222 transitions, 4285 flow [2025-03-15 01:26:03,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 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:03,866 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:03,866 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:03,873 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:26:04,066 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,SelfDestructingSolverStorable12 [2025-03-15 01:26:04,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:04,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1579219694, now seen corresponding path program 1 times [2025-03-15 01:26:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450885846] [2025-03-15 01:26:04,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450885846] [2025-03-15 01:26:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450885846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723142717] [2025-03-15 01:26:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:04,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:04,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:04,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:04,110 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:04,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 222 transitions, 4285 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:04,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:04,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:04,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:04,335 INFO L124 PetriNetUnfolderBase]: 921/2363 cut-off events. [2025-03-15 01:26:04,335 INFO L125 PetriNetUnfolderBase]: For 46690/51418 co-relation queries the response was YES. [2025-03-15 01:26:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18686 conditions, 2363 events. 921/2363 cut-off events. For 46690/51418 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19637 event pairs, 76 based on Foata normal form. 257/2075 useless extension candidates. Maximal degree in co-relation 18623. Up to 1128 conditions per place. [2025-03-15 01:26:04,360 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 152 selfloop transitions, 8 changer transitions 0/237 dead transitions. [2025-03-15 01:26:04,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 237 transitions, 5047 flow [2025-03-15 01:26:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 298 transitions. [2025-03-15 01:26:04,361 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7740259740259741 [2025-03-15 01:26:04,362 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 37 predicate places. [2025-03-15 01:26:04,362 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 237 transitions, 5047 flow [2025-03-15 01:26:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:04,362 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:04,362 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:04,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:26:04,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:04,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -3217232, now seen corresponding path program 1 times [2025-03-15 01:26:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899993740] [2025-03-15 01:26:04,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:04,410 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:26:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899993740] [2025-03-15 01:26:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899993740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835424812] [2025-03-15 01:26:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:04,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:04,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:26:04,412 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:04,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 237 transitions, 5047 flow. Second operand has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 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:04,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:04,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:04,612 INFO L124 PetriNetUnfolderBase]: 881/2356 cut-off events. [2025-03-15 01:26:04,612 INFO L125 PetriNetUnfolderBase]: For 57035/61210 co-relation queries the response was YES. [2025-03-15 01:26:04,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19303 conditions, 2356 events. 881/2356 cut-off events. For 57035/61210 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19212 event pairs, 37 based on Foata normal form. 30/1901 useless extension candidates. Maximal degree in co-relation 19236. Up to 1179 conditions per place. [2025-03-15 01:26:04,642 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 135 selfloop transitions, 41 changer transitions 0/243 dead transitions. [2025-03-15 01:26:04,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 243 transitions, 5547 flow [2025-03-15 01:26:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:26:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:26:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-03-15 01:26:04,644 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8593073593073594 [2025-03-15 01:26:04,645 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 42 predicate places. [2025-03-15 01:26:04,645 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 243 transitions, 5547 flow [2025-03-15 01:26:04,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 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:04,645 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:04,645 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:04,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:26:04,645 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:04,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash 805236833, now seen corresponding path program 1 times [2025-03-15 01:26:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090183596] [2025-03-15 01:26:04,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:04,710 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:26:04,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:04,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090183596] [2025-03-15 01:26:04,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090183596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:04,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:04,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:04,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313375692] [2025-03-15 01:26:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:04,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:04,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:04,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:26:04,712 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:04,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 243 transitions, 5547 flow. Second operand has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 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:04,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:04,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:04,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:04,968 INFO L124 PetriNetUnfolderBase]: 860/2304 cut-off events. [2025-03-15 01:26:04,968 INFO L125 PetriNetUnfolderBase]: For 68274/71982 co-relation queries the response was YES. [2025-03-15 01:26:04,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19868 conditions, 2304 events. 860/2304 cut-off events. For 68274/71982 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18299 event pairs, 51 based on Foata normal form. 30/1879 useless extension candidates. Maximal degree in co-relation 19797. Up to 1176 conditions per place. [2025-03-15 01:26:05,019 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 156 selfloop transitions, 26 changer transitions 0/249 dead transitions. [2025-03-15 01:26:05,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 249 transitions, 6071 flow [2025-03-15 01:26:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:26:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:26:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2025-03-15 01:26:05,024 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2025-03-15 01:26:05,025 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 47 predicate places. [2025-03-15 01:26:05,025 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 249 transitions, 6071 flow [2025-03-15 01:26:05,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 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:05,026 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:05,026 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:26:05,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:05,026 INFO L85 PathProgramCache]: Analyzing trace with hash 218778133, now seen corresponding path program 1 times [2025-03-15 01:26:05,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:05,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724027] [2025-03-15 01:26:05,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456724027] [2025-03-15 01:26:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456724027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114355743] [2025-03-15 01:26:05,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:05,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:05,095 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:26:05,096 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:26:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:05,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:26:05,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:05,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:05,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114355743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:05,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:05,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-15 01:26:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816278983] [2025-03-15 01:26:05,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:05,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:05,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:05,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:05,273 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:05,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 249 transitions, 6071 flow. Second operand has 10 states, 10 states have (on average 63.5) internal successors, (635), 10 states have internal predecessors, (635), 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:05,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:05,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:05,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:05,765 INFO L124 PetriNetUnfolderBase]: 1377/3784 cut-off events. [2025-03-15 01:26:05,765 INFO L125 PetriNetUnfolderBase]: For 141407/149185 co-relation queries the response was YES. [2025-03-15 01:26:05,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33157 conditions, 3784 events. 1377/3784 cut-off events. For 141407/149185 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 29243 event pairs, 105 based on Foata normal form. 27/3135 useless extension candidates. Maximal degree in co-relation 33082. Up to 2022 conditions per place. [2025-03-15 01:26:05,809 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 186 selfloop transitions, 103 changer transitions 1/357 dead transitions. [2025-03-15 01:26:05,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 357 transitions, 10035 flow [2025-03-15 01:26:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:26:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:26:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 735 transitions. [2025-03-15 01:26:05,811 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-03-15 01:26:05,811 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 57 predicate places. [2025-03-15 01:26:05,811 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 357 transitions, 10035 flow [2025-03-15 01:26:05,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.5) internal successors, (635), 10 states have internal predecessors, (635), 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:05,811 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:05,811 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-03-15 01:26:05,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 01:26:06,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:06,016 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:26:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1876450317, now seen corresponding path program 1 times [2025-03-15 01:26:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387606571] [2025-03-15 01:26:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:06,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387606571] [2025-03-15 01:26:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387606571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543545247] [2025-03-15 01:26:06,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:06,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:06,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:06,126 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:26:06,127 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:26:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:06,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 01:26:06,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:06,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:06,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543545247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:06,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:06,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-15 01:26:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761973884] [2025-03-15 01:26:06,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:06,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:26:06,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:06,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:26:06,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:26:06,383 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:06,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 357 transitions, 10035 flow. Second operand has 18 states, 18 states have (on average 63.333333333333336) internal successors, (1140), 18 states have internal predecessors, (1140), 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:06,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:06,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:07,223 INFO L124 PetriNetUnfolderBase]: 2024/5304 cut-off events. [2025-03-15 01:26:07,224 INFO L125 PetriNetUnfolderBase]: For 281866/295627 co-relation queries the response was YES. [2025-03-15 01:26:07,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50248 conditions, 5304 events. 2024/5304 cut-off events. For 281866/295627 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 38314 event pairs, 108 based on Foata normal form. 27/4462 useless extension candidates. Maximal degree in co-relation 50169. Up to 3031 conditions per place. [2025-03-15 01:26:07,309 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 264 selfloop transitions, 171 changer transitions 4/506 dead transitions. [2025-03-15 01:26:07,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 506 transitions, 15877 flow [2025-03-15 01:26:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 01:26:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 01:26:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1333 transitions. [2025-03-15 01:26:07,312 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8655844155844156 [2025-03-15 01:26:07,312 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 76 predicate places. [2025-03-15 01:26:07,312 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 506 transitions, 15877 flow [2025-03-15 01:26:07,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.333333333333336) internal successors, (1140), 18 states have internal predecessors, (1140), 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:07,313 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:07,313 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 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] [2025-03-15 01:26:07,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 01:26:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 01:26:07,514 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:07,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 548101196, now seen corresponding path program 2 times [2025-03-15 01:26:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789011438] [2025-03-15 01:26:07,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:07,531 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:07,531 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789011438] [2025-03-15 01:26:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789011438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908374871] [2025-03-15 01:26:07,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:07,724 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:26:07,727 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:26:07,782 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:07,782 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:07,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 01:26:07,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 01:26:08,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908374871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:08,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:08,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2025-03-15 01:26:08,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671509545] [2025-03-15 01:26:08,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:08,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 01:26:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:08,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 01:26:08,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-03-15 01:26:08,033 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 506 transitions, 15877 flow. Second operand has 13 states, 13 states have (on average 59.0) internal successors, (767), 13 states have internal predecessors, (767), 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,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:08,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:08,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:09,734 INFO L124 PetriNetUnfolderBase]: 3119/8570 cut-off events. [2025-03-15 01:26:09,734 INFO L125 PetriNetUnfolderBase]: For 426728/453840 co-relation queries the response was YES. [2025-03-15 01:26:09,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81441 conditions, 8570 events. 3119/8570 cut-off events. For 426728/453840 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 80124 event pairs, 180 based on Foata normal form. 2232/9584 useless extension candidates. Maximal degree in co-relation 81360. Up to 4992 conditions per place. [2025-03-15 01:26:09,788 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 0 selfloop transitions, 0 changer transitions 654/654 dead transitions. [2025-03-15 01:26:09,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 654 transitions, 22408 flow [2025-03-15 01:26:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 01:26:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 01:26:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1068 transitions. [2025-03-15 01:26:09,791 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7705627705627706 [2025-03-15 01:26:09,791 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 87 predicate places. [2025-03-15 01:26:09,791 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 654 transitions, 22408 flow [2025-03-15 01:26:09,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 59.0) internal successors, (767), 13 states have internal predecessors, (767), 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:09,797 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-2.i_petrified1_AllErrorsAtOnce [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:26:09,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:26:09,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:26:09,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 01:26:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:10,023 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:10,027 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:26:10,027 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:26:10,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:26:10 BasicIcfg [2025-03-15 01:26:10,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:26:10,031 INFO L158 Benchmark]: Toolchain (without parser) took 11315.27ms. Allocated memory was 71.3MB in the beginning and 532.7MB in the end (delta: 461.4MB). Free memory was 43.5MB in the beginning and 199.3MB in the end (delta: -155.7MB). Peak memory consumption was 445.7MB. Max. memory is 8.0GB. [2025-03-15 01:26:10,031 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 71.3MB. Free memory was 33.8MB in the beginning and 33.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:26:10,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.94ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 24.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:26:10,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.13ms. Allocated memory is still 71.3MB. Free memory was 24.2MB in the beginning and 22.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:26:10,032 INFO L158 Benchmark]: Boogie Preprocessor took 21.85ms. Allocated memory is still 71.3MB. Free memory was 22.7MB in the beginning and 21.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:26:10,032 INFO L158 Benchmark]: RCFGBuilder took 302.96ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 34.5MB in the end (delta: -12.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-03-15 01:26:10,032 INFO L158 Benchmark]: TraceAbstraction took 10617.32ms. Allocated memory was 71.3MB in the beginning and 532.7MB in the end (delta: 461.4MB). Free memory was 33.6MB in the beginning and 199.3MB in the end (delta: -165.7MB). Peak memory consumption was 438.5MB. Max. memory is 8.0GB. [2025-03-15 01:26:10,034 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.21ms. Allocated memory is still 71.3MB. Free memory was 33.8MB in the beginning and 33.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.94ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 24.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.13ms. Allocated memory is still 71.3MB. Free memory was 24.2MB in the beginning and 22.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.85ms. Allocated memory is still 71.3MB. Free memory was 22.7MB in the beginning and 21.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 302.96ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 34.5MB in the end (delta: -12.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 10617.32ms. Allocated memory was 71.3MB in the beginning and 532.7MB in the end (delta: 461.4MB). Free memory was 33.6MB in the beginning and 199.3MB in the end (delta: -165.7MB). Peak memory consumption was 438.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 568 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 57 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22408occurred in iteration=19, InterpolantAutomatonStates: 123, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1132 ConstructedInterpolants, 0 QuantifiedInterpolants, 2702 SizeOfPredicates, 25 NumberOfNonLiveVariables, 659 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 111/290 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:26:10,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...