/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-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:26:38,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:26:38,162 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:26:38,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:26:38,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:26:38,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:26:38,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:26:38,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:26:38,191 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:26:38,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:26:38,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:26:38,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:26:38,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:26:38,193 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:26:38,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:26:38,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:26:38,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:26:38,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:26:38,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:26:38,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:26:38,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:26:38,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:26:38,194 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:26:38,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:26:38,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:26:38,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:26:38,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:26:38,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:26:38,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-03-15 01:26:39,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23411239/d8232b270c6e49839624cc769a02a558/FLAGb6e9d51c9 [2025-03-15 01:26:39,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:26:39,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-03-15 01:26:39,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23411239/d8232b270c6e49839624cc769a02a558/FLAGb6e9d51c9 [2025-03-15 01:26:39,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23411239/d8232b270c6e49839624cc769a02a558 [2025-03-15 01:26:39,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:26:39,858 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:26:39,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:26:39,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:26:39,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:26:39,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:26:39" (1/1) ... [2025-03-15 01:26:39,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f76ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:39, skipping insertion in model container [2025-03-15 01:26:39,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:26:39" (1/1) ... [2025-03-15 01:26:39,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:26:40,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:26:40,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:26:40,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:26:40,133 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:26:40,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40 WrapperNode [2025-03-15 01:26:40,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:26:40,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:26:40,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:26:40,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:26:40,139 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:26:40" (1/1) ... [2025-03-15 01:26:40,150 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:26:40" (1/1) ... [2025-03-15 01:26:40,165 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-15 01:26:40,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:26:40,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:26:40,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:26:40,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:26:40,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:26:40,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:26:40,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:26:40,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:26:40,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (1/1) ... [2025-03-15 01:26:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:26:40,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:40,222 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:26:40,225 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:26:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:26:40,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:26:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:26:40,256 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:26:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:26:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:26:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:26:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:26:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:26:40,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:26:40,257 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:26:40,340 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:26:40,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:26:40,444 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:26:40,444 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:26:40,464 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:26:40,464 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:26:40,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:26:40 BoogieIcfgContainer [2025-03-15 01:26:40,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:26:40,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:26:40,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:26:40,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:26:40,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:26:39" (1/3) ... [2025-03-15 01:26:40,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7549fa4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:26:40, skipping insertion in model container [2025-03-15 01:26:40,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:40" (2/3) ... [2025-03-15 01:26:40,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7549fa4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:26:40, skipping insertion in model container [2025-03-15 01:26:40,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:26:40" (3/3) ... [2025-03-15 01:26:40,471 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-03-15 01:26:40,482 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:26:40,484 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 74 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:26:40,484 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:26:40,523 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:26:40,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:26:40,558 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;@27701e29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:26:40,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:26:40,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:26:40,576 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-15 01:26:40,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:26:40,578 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:40,579 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:26:40,579 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:26:40,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772315, now seen corresponding path program 1 times [2025-03-15 01:26:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113988283] [2025-03-15 01:26:40,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:40,787 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:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113988283] [2025-03-15 01:26:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113988283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882632363] [2025-03-15 01:26:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:40,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:40,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:40,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:40,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:40,812 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:40,815 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:26:40,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:40,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:40,916 INFO L124 PetriNetUnfolderBase]: 90/374 cut-off events. [2025-03-15 01:26:40,917 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:26:40,924 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:26:40,930 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 13 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-15 01:26:40,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 192 flow [2025-03-15 01:26:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-15 01:26:40,939 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2025-03-15 01:26:40,942 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-03-15 01:26:40,942 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 192 flow [2025-03-15 01:26:40,943 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:40,943 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:40,943 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:26:40,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:26:40,943 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:26:40,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772316, now seen corresponding path program 1 times [2025-03-15 01:26:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:40,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871869121] [2025-03-15 01:26:40,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:40,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:40,994 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:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871869121] [2025-03-15 01:26:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871869121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:40,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102930096] [2025-03-15 01:26:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:40,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:40,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:40,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:40,997 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:40,997 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:26:40,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:40,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:40,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:41,050 INFO L124 PetriNetUnfolderBase]: 75/359 cut-off events. [2025-03-15 01:26:41,051 INFO L125 PetriNetUnfolderBase]: For 33/55 co-relation queries the response was YES. [2025-03-15 01:26:41,052 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:41,054 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 19 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-15 01:26:41,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 266 flow [2025-03-15 01:26:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-03-15 01:26:41,055 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9004329004329005 [2025-03-15 01:26:41,055 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2025-03-15 01:26:41,056 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 266 flow [2025-03-15 01:26:41,056 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:41,056 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:41,056 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:41,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:26:41,056 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:41,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807743, now seen corresponding path program 1 times [2025-03-15 01:26:41,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455555257] [2025-03-15 01:26:41,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:41,125 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:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455555257] [2025-03-15 01:26:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455555257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:41,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:41,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331913278] [2025-03-15 01:26:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:41,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:41,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:41,128 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:41,128 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:41,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:41,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:41,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:41,288 INFO L124 PetriNetUnfolderBase]: 322/937 cut-off events. [2025-03-15 01:26:41,288 INFO L125 PetriNetUnfolderBase]: For 426/565 co-relation queries the response was YES. [2025-03-15 01:26:41,291 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:41,298 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 62 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-15 01:26:41,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 605 flow [2025-03-15 01:26:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-03-15 01:26:41,300 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825974025974026 [2025-03-15 01:26:41,301 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-03-15 01:26:41,301 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 121 transitions, 605 flow [2025-03-15 01:26:41,301 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:41,301 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:41,301 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:41,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:26:41,303 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:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875667, now seen corresponding path program 1 times [2025-03-15 01:26:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366417636] [2025-03-15 01:26:41,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:41,364 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:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366417636] [2025-03-15 01:26:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366417636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493826846] [2025-03-15 01:26:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:41,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:41,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:41,366 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:41,366 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:41,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:41,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:41,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:41,486 INFO L124 PetriNetUnfolderBase]: 481/1386 cut-off events. [2025-03-15 01:26:41,486 INFO L125 PetriNetUnfolderBase]: For 1262/1491 co-relation queries the response was YES. [2025-03-15 01:26:41,490 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:41,497 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:26:41,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 837 flow [2025-03-15 01:26:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-15 01:26:41,500 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-15 01:26:41,500 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2025-03-15 01:26:41,500 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 134 transitions, 837 flow [2025-03-15 01:26:41,501 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:41,501 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:41,501 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:41,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:26:41,501 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:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875666, now seen corresponding path program 1 times [2025-03-15 01:26:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:41,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013292848] [2025-03-15 01:26:41,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:41,563 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:41,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:41,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013292848] [2025-03-15 01:26:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013292848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:41,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256254544] [2025-03-15 01:26:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:41,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:41,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:41,565 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:41,565 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:41,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:41,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:41,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:41,671 INFO L124 PetriNetUnfolderBase]: 482/1292 cut-off events. [2025-03-15 01:26:41,671 INFO L125 PetriNetUnfolderBase]: For 1928/2239 co-relation queries the response was YES. [2025-03-15 01:26:41,673 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:41,679 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:26:41,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 134 transitions, 953 flow [2025-03-15 01:26:41,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-15 01:26:41,681 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-15 01:26:41,683 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-03-15 01:26:41,683 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 134 transitions, 953 flow [2025-03-15 01:26:41,684 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:41,684 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:41,684 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:41,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:26:41,684 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:41,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 864787734, now seen corresponding path program 1 times [2025-03-15 01:26:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:41,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294858805] [2025-03-15 01:26:41,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:41,754 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:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294858805] [2025-03-15 01:26:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294858805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:41,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:41,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331695535] [2025-03-15 01:26:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:41,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:41,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:41,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:41,756 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:41,757 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:41,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:41,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:41,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:41,969 INFO L124 PetriNetUnfolderBase]: 951/2226 cut-off events. [2025-03-15 01:26:41,969 INFO L125 PetriNetUnfolderBase]: For 7090/7459 co-relation queries the response was YES. [2025-03-15 01:26:41,974 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:41,989 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 92 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2025-03-15 01:26:41,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 160 transitions, 1397 flow [2025-03-15 01:26:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-15 01:26:41,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2025-03-15 01:26:41,992 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-15 01:26:41,992 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 160 transitions, 1397 flow [2025-03-15 01:26:41,992 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:41,992 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:41,992 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:41,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:26:41,992 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:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1597002897, now seen corresponding path program 1 times [2025-03-15 01:26:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242609240] [2025-03-15 01:26:41,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:42,063 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:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242609240] [2025-03-15 01:26:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242609240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796852084] [2025-03-15 01:26:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:42,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:42,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:42,068 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:42,070 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:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:42,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:26:42,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:42,179 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:42,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796852084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:26:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314507570] [2025-03-15 01:26:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:42,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:42,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:42,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:26:42,180 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:42,181 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:42,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:42,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:42,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:42,387 INFO L124 PetriNetUnfolderBase]: 920/2295 cut-off events. [2025-03-15 01:26:42,387 INFO L125 PetriNetUnfolderBase]: For 8736/9999 co-relation queries the response was YES. [2025-03-15 01:26:42,391 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:42,404 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 103 selfloop transitions, 6 changer transitions 0/173 dead transitions. [2025-03-15 01:26:42,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 1813 flow [2025-03-15 01:26:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:26:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:26:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-03-15 01:26:42,406 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.801948051948052 [2025-03-15 01:26:42,407 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2025-03-15 01:26:42,407 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 173 transitions, 1813 flow [2025-03-15 01:26:42,407 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:42,407 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:42,407 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:42,417 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:42,612 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:42,612 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:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 88120632, now seen corresponding path program 1 times [2025-03-15 01:26:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136315479] [2025-03-15 01:26:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:42,661 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:42,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:42,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136315479] [2025-03-15 01:26:42,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136315479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:42,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:42,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050076637] [2025-03-15 01:26:42,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:42,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:42,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:42,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:42,663 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:42,663 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:42,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:42,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:42,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:42,905 INFO L124 PetriNetUnfolderBase]: 1196/2954 cut-off events. [2025-03-15 01:26:42,906 INFO L125 PetriNetUnfolderBase]: For 15692/17010 co-relation queries the response was YES. [2025-03-15 01:26:42,914 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:42,964 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 89 selfloop transitions, 44 changer transitions 0/203 dead transitions. [2025-03-15 01:26:42,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 203 transitions, 2469 flow [2025-03-15 01:26:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2025-03-15 01:26:42,965 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2025-03-15 01:26:42,966 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-15 01:26:42,966 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 203 transitions, 2469 flow [2025-03-15 01:26:42,966 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:42,966 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:42,966 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:42,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:26:42,966 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:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1521756979, now seen corresponding path program 1 times [2025-03-15 01:26:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101051781] [2025-03-15 01:26:42,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,002 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:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101051781] [2025-03-15 01:26:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101051781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172175504] [2025-03-15 01:26:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:43,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:43,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:43,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:43,004 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:43,004 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:43,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:43,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:43,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,347 INFO L124 PetriNetUnfolderBase]: 1125/2943 cut-off events. [2025-03-15 01:26:43,347 INFO L125 PetriNetUnfolderBase]: For 26303/27999 co-relation queries the response was YES. [2025-03-15 01:26:43,356 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:43,377 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 118 selfloop transitions, 26 changer transitions 0/214 dead transitions. [2025-03-15 01:26:43,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 214 transitions, 2825 flow [2025-03-15 01:26:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2025-03-15 01:26:43,379 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8883116883116883 [2025-03-15 01:26:43,379 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:26:43,379 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 214 transitions, 2825 flow [2025-03-15 01:26:43,380 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:43,380 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,380 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:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:26:43,380 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:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 499182071, now seen corresponding path program 1 times [2025-03-15 01:26:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674836046] [2025-03-15 01:26:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,427 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:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674836046] [2025-03-15 01:26:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674836046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325965056] [2025-03-15 01:26:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:43,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:43,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:43,429 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:43,429 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:43,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:43,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:43,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,689 INFO L124 PetriNetUnfolderBase]: 949/2572 cut-off events. [2025-03-15 01:26:43,690 INFO L125 PetriNetUnfolderBase]: For 35134/37087 co-relation queries the response was YES. [2025-03-15 01:26:43,696 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:43,709 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 110 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-03-15 01:26:43,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 182 transitions, 2499 flow [2025-03-15 01:26:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:26:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:26:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-15 01:26:43,710 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2025-03-15 01:26:43,711 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:26:43,711 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 182 transitions, 2499 flow [2025-03-15 01:26:43,711 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:43,711 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,711 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:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:26:43,711 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:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 499182072, now seen corresponding path program 1 times [2025-03-15 01:26:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528375010] [2025-03-15 01:26:43,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,745 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:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528375010] [2025-03-15 01:26:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528375010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380843389] [2025-03-15 01:26:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:43,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:43,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:43,747 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:43,747 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:43,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:43,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:43,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,976 INFO L124 PetriNetUnfolderBase]: 981/2688 cut-off events. [2025-03-15 01:26:43,976 INFO L125 PetriNetUnfolderBase]: For 45020/46968 co-relation queries the response was YES. [2025-03-15 01:26:43,983 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:43,998 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 105 selfloop transitions, 15 changer transitions 0/190 dead transitions. [2025-03-15 01:26:43,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 190 transitions, 2895 flow [2025-03-15 01:26:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-03-15 01:26:43,999 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8727272727272727 [2025-03-15 01:26:43,999 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 26 predicate places. [2025-03-15 01:26:43,999 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 190 transitions, 2895 flow [2025-03-15 01:26:43,999 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:43,999 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,999 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:44,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:26:44,000 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:44,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2032517975, now seen corresponding path program 1 times [2025-03-15 01:26:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788581774] [2025-03-15 01:26:44,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:44,026 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:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:44,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788581774] [2025-03-15 01:26:44,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788581774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:44,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:44,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488115207] [2025-03-15 01:26:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:44,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:44,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:44,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:44,028 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:44,028 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:44,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:44,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:44,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:44,274 INFO L124 PetriNetUnfolderBase]: 974/2466 cut-off events. [2025-03-15 01:26:44,275 INFO L125 PetriNetUnfolderBase]: For 57344/64031 co-relation queries the response was YES. [2025-03-15 01:26:44,281 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:44,298 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 120 selfloop transitions, 8 changer transitions 0/207 dead transitions. [2025-03-15 01:26:44,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 3583 flow [2025-03-15 01:26:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2025-03-15 01:26:44,300 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-03-15 01:26:44,301 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-03-15 01:26:44,301 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 207 transitions, 3583 flow [2025-03-15 01:26:44,301 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:44,301 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:44,301 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:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:26:44,301 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:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1888720087, now seen corresponding path program 1 times [2025-03-15 01:26:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144503188] [2025-03-15 01:26:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:44,347 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:44,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144503188] [2025-03-15 01:26:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144503188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567163165] [2025-03-15 01:26:44,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:44,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:44,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:44,350 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:44,352 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:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:44,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:26:44,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:44,423 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:44,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567163165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:44,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:26:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050495697] [2025-03-15 01:26:44,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:44,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:26:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:44,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:26:44,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:26:44,425 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:44,425 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:44,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:44,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:44,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:44,743 INFO L124 PetriNetUnfolderBase]: 889/2559 cut-off events. [2025-03-15 01:26:44,744 INFO L125 PetriNetUnfolderBase]: For 41390/44817 co-relation queries the response was YES. [2025-03-15 01:26:44,752 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:44,769 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 138 selfloop transitions, 7 changer transitions 0/222 dead transitions. [2025-03-15 01:26:44,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 4285 flow [2025-03-15 01:26:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:26:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:26:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2025-03-15 01:26:44,771 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2025-03-15 01:26:44,771 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 34 predicate places. [2025-03-15 01:26:44,772 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 222 transitions, 4285 flow [2025-03-15 01:26:44,772 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:44,772 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:44,773 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:44,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 01:26:44,977 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:44,977 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:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1579219694, now seen corresponding path program 1 times [2025-03-15 01:26:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480932823] [2025-03-15 01:26:44,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,016 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:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480932823] [2025-03-15 01:26:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480932823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430012219] [2025-03-15 01:26:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:45,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:45,018 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:45,018 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:45,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,249 INFO L124 PetriNetUnfolderBase]: 921/2363 cut-off events. [2025-03-15 01:26:45,250 INFO L125 PetriNetUnfolderBase]: For 46690/51418 co-relation queries the response was YES. [2025-03-15 01:26:45,260 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:45,279 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 152 selfloop transitions, 8 changer transitions 0/237 dead transitions. [2025-03-15 01:26:45,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 237 transitions, 5047 flow [2025-03-15 01:26:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 298 transitions. [2025-03-15 01:26:45,281 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7740259740259741 [2025-03-15 01:26:45,281 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 37 predicate places. [2025-03-15 01:26:45,282 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 237 transitions, 5047 flow [2025-03-15 01:26:45,282 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:45,282 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,282 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:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:26:45,282 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:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -3217232, now seen corresponding path program 1 times [2025-03-15 01:26:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650600675] [2025-03-15 01:26:45,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,326 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:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650600675] [2025-03-15 01:26:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650600675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216654824] [2025-03-15 01:26:45,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:45,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:26:45,328 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:45,328 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:45,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:45,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,577 INFO L124 PetriNetUnfolderBase]: 881/2356 cut-off events. [2025-03-15 01:26:45,578 INFO L125 PetriNetUnfolderBase]: For 57035/61210 co-relation queries the response was YES. [2025-03-15 01:26:45,586 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:45,609 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 135 selfloop transitions, 41 changer transitions 0/243 dead transitions. [2025-03-15 01:26:45,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 243 transitions, 5547 flow [2025-03-15 01:26:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:26:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:26:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-03-15 01:26:45,611 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8593073593073594 [2025-03-15 01:26:45,611 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 42 predicate places. [2025-03-15 01:26:45,611 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 243 transitions, 5547 flow [2025-03-15 01:26:45,611 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:45,611 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,611 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:45,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:26:45,612 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:45,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash 805236833, now seen corresponding path program 1 times [2025-03-15 01:26:45,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283385823] [2025-03-15 01:26:45,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,670 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:45,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283385823] [2025-03-15 01:26:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283385823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663484245] [2025-03-15 01:26:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:45,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:26:45,672 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:45,672 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:45,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:45,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,950 INFO L124 PetriNetUnfolderBase]: 860/2304 cut-off events. [2025-03-15 01:26:45,950 INFO L125 PetriNetUnfolderBase]: For 68274/71982 co-relation queries the response was YES. [2025-03-15 01:26:45,960 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:45,982 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 156 selfloop transitions, 26 changer transitions 0/249 dead transitions. [2025-03-15 01:26:45,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 249 transitions, 6071 flow [2025-03-15 01:26:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:26:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:26:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2025-03-15 01:26:45,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2025-03-15 01:26:45,984 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 47 predicate places. [2025-03-15 01:26:45,984 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 249 transitions, 6071 flow [2025-03-15 01:26:45,985 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:45,985 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,985 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:45,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:26:45,985 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:45,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 218778133, now seen corresponding path program 1 times [2025-03-15 01:26:45,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916347204] [2025-03-15 01:26:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:46,037 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:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916347204] [2025-03-15 01:26:46,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916347204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:46,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012025474] [2025-03-15 01:26:46,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:46,040 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:46,041 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:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:46,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:26:46,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:46,150 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:46,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:46,219 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:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012025474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:46,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-15 01:26:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78603099] [2025-03-15 01:26:46,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:46,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:46,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:46,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:46,221 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:46,222 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:46,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:46,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:46,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:46,668 INFO L124 PetriNetUnfolderBase]: 1377/3784 cut-off events. [2025-03-15 01:26:46,668 INFO L125 PetriNetUnfolderBase]: For 141407/149185 co-relation queries the response was YES. [2025-03-15 01:26:46,682 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:46,710 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 186 selfloop transitions, 103 changer transitions 1/357 dead transitions. [2025-03-15 01:26:46,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 357 transitions, 10035 flow [2025-03-15 01:26:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:26:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:26:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 735 transitions. [2025-03-15 01:26:46,715 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-03-15 01:26:46,715 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 57 predicate places. [2025-03-15 01:26:46,715 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 357 transitions, 10035 flow [2025-03-15 01:26:46,716 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:46,716 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:46,716 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:46,722 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:46,916 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:46,916 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:46,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1876450317, now seen corresponding path program 1 times [2025-03-15 01:26:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:46,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110152550] [2025-03-15 01:26:46,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:47,015 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:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:47,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110152550] [2025-03-15 01:26:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110152550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:47,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276395756] [2025-03-15 01:26:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:47,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:47,018 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:47,019 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:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:47,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 01:26:47,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:47,146 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:47,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:47,283 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:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276395756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:47,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-15 01:26:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58856450] [2025-03-15 01:26:47,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:47,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:26:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:47,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:26:47,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:26:47,285 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:47,286 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:47,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:47,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:47,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:48,050 INFO L124 PetriNetUnfolderBase]: 2024/5304 cut-off events. [2025-03-15 01:26:48,050 INFO L125 PetriNetUnfolderBase]: For 281866/295627 co-relation queries the response was YES. [2025-03-15 01:26:48,069 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:48,108 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 264 selfloop transitions, 171 changer transitions 4/506 dead transitions. [2025-03-15 01:26:48,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 506 transitions, 15877 flow [2025-03-15 01:26:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 01:26:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 01:26:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1333 transitions. [2025-03-15 01:26:48,111 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8655844155844156 [2025-03-15 01:26:48,111 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 76 predicate places. [2025-03-15 01:26:48,111 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 506 transitions, 15877 flow [2025-03-15 01:26:48,112 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:48,112 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:48,112 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:48,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 01:26:48,315 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:48,315 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:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 548101196, now seen corresponding path program 2 times [2025-03-15 01:26:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086274118] [2025-03-15 01:26:48,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:48,332 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:48,332 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:48,527 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:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086274118] [2025-03-15 01:26:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086274118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451405793] [2025-03-15 01:26:48,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:48,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:48,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:48,530 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:48,532 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:48,584 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:48,585 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:48,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:26:48,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:48,712 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:48,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:48,996 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:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451405793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:48,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-15 01:26:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626449140] [2025-03-15 01:26:48,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 01:26:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:48,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 01:26:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-03-15 01:26:48,998 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:49,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 506 transitions, 15877 flow. Second operand has 30 states, 30 states have (on average 63.166666666666664) internal successors, (1895), 30 states have internal predecessors, (1895), 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:49,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:49,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:49,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:50,979 INFO L124 PetriNetUnfolderBase]: 3528/9400 cut-off events. [2025-03-15 01:26:50,979 INFO L125 PetriNetUnfolderBase]: For 585211/611603 co-relation queries the response was YES. [2025-03-15 01:26:51,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91691 conditions, 9400 events. 3528/9400 cut-off events. For 585211/611603 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 67845 event pairs, 276 based on Foata normal form. 27/7914 useless extension candidates. Maximal degree in co-relation 91608. Up to 5580 conditions per place. [2025-03-15 01:26:51,077 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 450 selfloop transitions, 301 changer transitions 0/818 dead transitions. [2025-03-15 01:26:51,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 818 transitions, 28403 flow [2025-03-15 01:26:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:26:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:26:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2059 transitions. [2025-03-15 01:26:51,080 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8625890238793464 [2025-03-15 01:26:51,080 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 106 predicate places. [2025-03-15 01:26:51,081 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 818 transitions, 28403 flow [2025-03-15 01:26:51,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.166666666666664) internal successors, (1895), 30 states have internal predecessors, (1895), 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:51,081 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:51,081 INFO L221 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 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:51,087 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:51,282 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:51,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1601333667, now seen corresponding path program 2 times [2025-03-15 01:26:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865136520] [2025-03-15 01:26:51,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:51,316 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:51,316 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:51,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865136520] [2025-03-15 01:26:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865136520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973181714] [2025-03-15 01:26:51,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:51,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:51,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:51,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:26:51,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:26:52,036 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:52,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:52,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-15 01:26:52,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-15 01:26:52,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973181714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:52,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [29] total 51 [2025-03-15 01:26:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568949594] [2025-03-15 01:26:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 01:26:52,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:52,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 01:26:52,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2169, Unknown=0, NotChecked=0, Total=2550 [2025-03-15 01:26:52,532 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:52,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 818 transitions, 28403 flow. Second operand has 23 states, 23 states have (on average 59.04347826086956) internal successors, (1358), 23 states have internal predecessors, (1358), 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:52,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:52,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:00,387 INFO L124 PetriNetUnfolderBase]: 11476/29087 cut-off events. [2025-03-15 01:27:00,387 INFO L125 PetriNetUnfolderBase]: For 1779288/1867740 co-relation queries the response was YES. [2025-03-15 01:27:00,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298696 conditions, 29087 events. 11476/29087 cut-off events. For 1779288/1867740 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 289944 event pairs, 600 based on Foata normal form. 6391/30829 useless extension candidates. Maximal degree in co-relation 298611. Up to 19416 conditions per place. [2025-03-15 01:27:00,657 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 0 selfloop transitions, 0 changer transitions 2106/2106 dead transitions. [2025-03-15 01:27:00,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 2106 transitions, 82643 flow [2025-03-15 01:27:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:27:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:27:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1932 transitions. [2025-03-15 01:27:00,659 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7603305785123967 [2025-03-15 01:27:00,660 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 128 predicate places. [2025-03-15 01:27:00,660 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 2106 transitions, 82643 flow [2025-03-15 01:27:00,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 59.04347826086956) internal successors, (1358), 23 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:00,664 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longer-2.i_petrified1_AllErrorsAtOnce [2025-03-15 01:27:00,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:27:00,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:27:00,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 01:27:00,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:00,895 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:00,899 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:27:00,899 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:27:00,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:27:00 BasicIcfg [2025-03-15 01:27:00,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:27:00,902 INFO L158 Benchmark]: Toolchain (without parser) took 21045.18ms. Allocated memory was 71.3MB in the beginning and 897.6MB in the end (delta: 826.3MB). Free memory was 42.9MB in the beginning and 142.3MB in the end (delta: -99.4MB). Peak memory consumption was 912.5MB. Max. memory is 8.0GB. [2025-03-15 01:27:00,903 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:27:00,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.13ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 23.7MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:27:00,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.70ms. Allocated memory is still 71.3MB. Free memory was 23.7MB in the beginning and 22.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:27:00,903 INFO L158 Benchmark]: Boogie Preprocessor took 20.59ms. Allocated memory is still 71.3MB. Free memory was 22.1MB in the beginning and 21.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:27:00,903 INFO L158 Benchmark]: RCFGBuilder took 274.74ms. Allocated memory is still 71.3MB. Free memory was 21.1MB in the beginning and 34.0MB in the end (delta: -12.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-03-15 01:27:00,903 INFO L158 Benchmark]: TraceAbstraction took 20435.54ms. Allocated memory was 71.3MB in the beginning and 897.6MB in the end (delta: 826.3MB). Free memory was 33.0MB in the beginning and 142.3MB in the end (delta: -109.3MB). Peak memory consumption was 905.4MB. Max. memory is 8.0GB. [2025-03-15 01:27:00,904 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.13ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 23.7MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.70ms. Allocated memory is still 71.3MB. Free memory was 23.7MB in the beginning and 22.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.59ms. Allocated memory is still 71.3MB. Free memory was 22.1MB in the beginning and 21.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 274.74ms. Allocated memory is still 71.3MB. Free memory was 21.1MB in the beginning and 34.0MB in the end (delta: -12.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 20435.54ms. Allocated memory was 71.3MB in the beginning and 897.6MB in the end (delta: 826.3MB). Free memory was 33.0MB in the beginning and 142.3MB in the end (delta: -109.3MB). Peak memory consumption was 905.4MB. 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: 20.4s, OverallIterations: 20, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1003 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1003 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1494 IncrementalHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 64 mSDtfsCounter, 1494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82643occurred in iteration=20, InterpolantAutomatonStates: 169, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1466 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1673 ConstructedInterpolants, 0 QuantifiedInterpolants, 4227 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 615/1577 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:27:00,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...