/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/reorder_5.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:24:41,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:24:41,627 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:24:41,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:24:41,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:24:41,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:24:41,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:24:41,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:24:41,658 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:24:41,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:24:41,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:24:41,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:41,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:24:41,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:24:41,660 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:24:41,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:24:41,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:24:41,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:24:41,939 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:24:41,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:24:41,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/reorder_5.i [2025-03-15 01:24:43,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac4e00eb/032d329418c14507b9a8fa5ebbe17771/FLAGa9bd4cf7f [2025-03-15 01:24:43,435 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:24:43,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_5.i [2025-03-15 01:24:43,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac4e00eb/032d329418c14507b9a8fa5ebbe17771/FLAGa9bd4cf7f [2025-03-15 01:24:43,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac4e00eb/032d329418c14507b9a8fa5ebbe17771 [2025-03-15 01:24:43,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:24:43,732 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:24:43,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:43,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:24:43,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:24:43,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664bbf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43, skipping insertion in model container [2025-03-15 01:24:43,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:24:44,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:44,081 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:24:44,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:44,202 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:24:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44 WrapperNode [2025-03-15 01:24:44,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:44,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:44,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:24:44,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:24:44,209 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:24:44" (1/1) ... [2025-03-15 01:24:44,228 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:24:44" (1/1) ... [2025-03-15 01:24:44,249 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-03-15 01:24:44,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:44,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:24:44,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:24:44,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:24:44,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:24:44,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:24:44,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:24:44,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:24:44,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (1/1) ... [2025-03-15 01:24:44,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:44,317 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:24:44,319 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:24:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-15 01:24:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-15 01:24:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:24:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:24:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:24:44,348 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:24:44,451 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:24:44,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:24:44,653 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:24:44,653 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:24:44,664 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:24:44,664 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:24:44,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:44 BoogieIcfgContainer [2025-03-15 01:24:44,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:24:44,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:24:44,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:24:44,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:24:44,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:24:43" (1/3) ... [2025-03-15 01:24:44,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a8c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:44, skipping insertion in model container [2025-03-15 01:24:44,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:44" (2/3) ... [2025-03-15 01:24:44,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a8c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:44, skipping insertion in model container [2025-03-15 01:24:44,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:44" (3/3) ... [2025-03-15 01:24:44,675 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-03-15 01:24:44,688 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:24:44,690 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 143 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-15 01:24:44,690 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:24:44,735 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:24:44,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:44,788 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;@3e86739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:44,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:24:44,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:44,837 INFO L124 PetriNetUnfolderBase]: 4/93 cut-off events. [2025-03-15 01:24:44,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:24:44,839 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:44,840 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:44,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:44,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1213037125, now seen corresponding path program 1 times [2025-03-15 01:24:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:44,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357608017] [2025-03-15 01:24:44,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:45,142 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:24:45,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357608017] [2025-03-15 01:24:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357608017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:45,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648810744] [2025-03-15 01:24:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:45,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:45,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:45,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:45,171 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 156 [2025-03-15 01:24:45,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 156 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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:24:45,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:45,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 156 [2025-03-15 01:24:45,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:45,356 INFO L124 PetriNetUnfolderBase]: 13/377 cut-off events. [2025-03-15 01:24:45,356 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-15 01:24:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 377 events. 13/377 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1435 event pairs, 0 based on Foata normal form. 53/374 useless extension candidates. Maximal degree in co-relation 218. Up to 66 conditions per place. [2025-03-15 01:24:45,366 INFO L140 encePairwiseOnDemand]: 136/156 looper letters, 44 selfloop transitions, 10 changer transitions 36/170 dead transitions. [2025-03-15 01:24:45,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 170 transitions, 492 flow [2025-03-15 01:24:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2025-03-15 01:24:45,380 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7974358974358975 [2025-03-15 01:24:45,383 INFO L298 CegarLoopForPetriNet]: 149 programPoint places, 1 predicate places. [2025-03-15 01:24:45,383 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 170 transitions, 492 flow [2025-03-15 01:24:45,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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:24:45,383 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,383 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:45,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:24:45,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1286126969, now seen corresponding path program 1 times [2025-03-15 01:24:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411083837] [2025-03-15 01:24:45,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:45,501 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:24:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411083837] [2025-03-15 01:24:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411083837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64688803] [2025-03-15 01:24:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:45,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:45,505 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 156 [2025-03-15 01:24:45,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 170 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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:24:45,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:45,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 156 [2025-03-15 01:24:45,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:45,713 INFO L124 PetriNetUnfolderBase]: 16/590 cut-off events. [2025-03-15 01:24:45,713 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-15 01:24:45,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 590 events. 16/590 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2986 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 413. Up to 123 conditions per place. [2025-03-15 01:24:45,716 INFO L140 encePairwiseOnDemand]: 143/156 looper letters, 87 selfloop transitions, 9 changer transitions 45/220 dead transitions. [2025-03-15 01:24:45,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 220 transitions, 934 flow [2025-03-15 01:24:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2025-03-15 01:24:45,718 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8493589743589743 [2025-03-15 01:24:45,719 INFO L298 CegarLoopForPetriNet]: 149 programPoint places, 4 predicate places. [2025-03-15 01:24:45,719 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 220 transitions, 934 flow [2025-03-15 01:24:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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:24:45,719 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,721 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, 1, 1, 1] [2025-03-15 01:24:45,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:24:45,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1566344499, now seen corresponding path program 1 times [2025-03-15 01:24:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204379103] [2025-03-15 01:24:45,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:45,749 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:24:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:45,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:24:45,774 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:24:45,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:24:45,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:24:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:24:45,777 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-15 01:24:45,778 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:24:45,778 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 01:24:45,801 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-15 01:24:45,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:45,804 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;@3e86739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:45,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:24:45,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:45,810 INFO L124 PetriNetUnfolderBase]: 4/93 cut-off events. [2025-03-15 01:24:45,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:24:45,810 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,810 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:45,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash -753608069, now seen corresponding path program 1 times [2025-03-15 01:24:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054204375] [2025-03-15 01:24:45,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:45,890 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:24:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054204375] [2025-03-15 01:24:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054204375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:45,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839817141] [2025-03-15 01:24:45,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:45,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:45,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:45,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:45,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:45,893 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 178 [2025-03-15 01:24:45,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 178 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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:24:45,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:45,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 178 [2025-03-15 01:24:45,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:46,152 INFO L124 PetriNetUnfolderBase]: 100/1549 cut-off events. [2025-03-15 01:24:46,153 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-15 01:24:46,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 1549 events. 100/1549 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10956 event pairs, 0 based on Foata normal form. 423/1721 useless extension candidates. Maximal degree in co-relation 1077. Up to 298 conditions per place. [2025-03-15 01:24:46,160 INFO L140 encePairwiseOnDemand]: 157/178 looper letters, 65 selfloop transitions, 10 changer transitions 34/203 dead transitions. [2025-03-15 01:24:46,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 203 transitions, 632 flow [2025-03-15 01:24:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2025-03-15 01:24:46,163 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8033707865168539 [2025-03-15 01:24:46,164 INFO L298 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2025-03-15 01:24:46,164 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 203 transitions, 632 flow [2025-03-15 01:24:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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:24:46,164 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:46,166 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:24:46,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:46,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1472984954, now seen corresponding path program 1 times [2025-03-15 01:24:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919089982] [2025-03-15 01:24:46,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:46,235 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:24:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919089982] [2025-03-15 01:24:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919089982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880077626] [2025-03-15 01:24:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:46,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:46,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:46,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:46,237 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 178 [2025-03-15 01:24:46,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 203 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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:24:46,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:46,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 178 [2025-03-15 01:24:46,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:46,671 INFO L124 PetriNetUnfolderBase]: 171/2750 cut-off events. [2025-03-15 01:24:46,671 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-15 01:24:46,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4807 conditions, 2750 events. 171/2750 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23619 event pairs, 0 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 2288. Up to 537 conditions per place. [2025-03-15 01:24:46,681 INFO L140 encePairwiseOnDemand]: 165/178 looper letters, 124 selfloop transitions, 10 changer transitions 39/271 dead transitions. [2025-03-15 01:24:46,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 271 transitions, 1250 flow [2025-03-15 01:24:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2025-03-15 01:24:46,685 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8567415730337079 [2025-03-15 01:24:46,686 INFO L298 CegarLoopForPetriNet]: 170 programPoint places, 5 predicate places. [2025-03-15 01:24:46,686 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 271 transitions, 1250 flow [2025-03-15 01:24:46,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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:24:46,686 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:46,686 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:46,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:24:46,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 745050578, now seen corresponding path program 1 times [2025-03-15 01:24:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989682811] [2025-03-15 01:24:46,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:46,751 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:24:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989682811] [2025-03-15 01:24:46,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989682811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:46,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253404689] [2025-03-15 01:24:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:46,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:46,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:46,753 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 178 [2025-03-15 01:24:46,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 271 transitions, 1250 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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:24:46,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:46,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 178 [2025-03-15 01:24:46,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:47,149 INFO L124 PetriNetUnfolderBase]: 171/2740 cut-off events. [2025-03-15 01:24:47,149 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-15 01:24:47,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 2740 events. 171/2740 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23553 event pairs, 0 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 2722. Up to 552 conditions per place. [2025-03-15 01:24:47,158 INFO L140 encePairwiseOnDemand]: 165/178 looper letters, 117 selfloop transitions, 19 changer transitions 39/274 dead transitions. [2025-03-15 01:24:47,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 274 transitions, 1544 flow [2025-03-15 01:24:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2025-03-15 01:24:47,160 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7876404494382022 [2025-03-15 01:24:47,161 INFO L298 CegarLoopForPetriNet]: 170 programPoint places, 9 predicate places. [2025-03-15 01:24:47,161 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 274 transitions, 1544 flow [2025-03-15 01:24:47,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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:24:47,161 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:47,161 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:47,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:24:47,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:47,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash -663276906, now seen corresponding path program 1 times [2025-03-15 01:24:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:47,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779392244] [2025-03-15 01:24:47,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:47,242 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:24:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779392244] [2025-03-15 01:24:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779392244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712240325] [2025-03-15 01:24:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:47,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:47,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:47,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:47,244 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 178 [2025-03-15 01:24:47,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 274 transitions, 1544 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 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:24:47,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:47,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 178 [2025-03-15 01:24:47,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:47,657 INFO L124 PetriNetUnfolderBase]: 171/2738 cut-off events. [2025-03-15 01:24:47,657 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2025-03-15 01:24:47,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6647 conditions, 2738 events. 171/2738 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23549 event pairs, 0 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 3161. Up to 552 conditions per place. [2025-03-15 01:24:47,665 INFO L140 encePairwiseOnDemand]: 166/178 looper letters, 113 selfloop transitions, 22 changer transitions 39/273 dead transitions. [2025-03-15 01:24:47,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 273 transitions, 1826 flow [2025-03-15 01:24:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2025-03-15 01:24:47,668 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7600321027287319 [2025-03-15 01:24:47,670 INFO L298 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places. [2025-03-15 01:24:47,670 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 273 transitions, 1826 flow [2025-03-15 01:24:47,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 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:24:47,670 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:47,671 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:47,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:24:47,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:47,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash 913252879, now seen corresponding path program 1 times [2025-03-15 01:24:47,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:47,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987963359] [2025-03-15 01:24:47,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:47,778 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:24:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987963359] [2025-03-15 01:24:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987963359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:47,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731688078] [2025-03-15 01:24:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:47,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:47,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:47,780 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 178 [2025-03-15 01:24:47,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 273 transitions, 1826 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 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:24:47,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:47,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 178 [2025-03-15 01:24:47,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:48,183 INFO L124 PetriNetUnfolderBase]: 171/2736 cut-off events. [2025-03-15 01:24:48,184 INFO L125 PetriNetUnfolderBase]: For 3675/3675 co-relation queries the response was YES. [2025-03-15 01:24:48,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 2736 events. 171/2736 cut-off events. For 3675/3675 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23503 event pairs, 0 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 3596. Up to 552 conditions per place. [2025-03-15 01:24:48,197 INFO L140 encePairwiseOnDemand]: 166/178 looper letters, 116 selfloop transitions, 26 changer transitions 39/280 dead transitions. [2025-03-15 01:24:48,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 280 transitions, 2200 flow [2025-03-15 01:24:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1074 transitions. [2025-03-15 01:24:48,199 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7542134831460674 [2025-03-15 01:24:48,200 INFO L298 CegarLoopForPetriNet]: 170 programPoint places, 20 predicate places. [2025-03-15 01:24:48,200 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 280 transitions, 2200 flow [2025-03-15 01:24:48,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 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:24:48,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:48,201 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:48,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:24:48,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:48,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1943474583, now seen corresponding path program 1 times [2025-03-15 01:24:48,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823132483] [2025-03-15 01:24:48,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:48,267 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:24:48,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:48,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823132483] [2025-03-15 01:24:48,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823132483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:48,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:48,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494535797] [2025-03-15 01:24:48,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:48,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:48,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:48,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:48,268 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 178 [2025-03-15 01:24:48,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 280 transitions, 2200 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 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:24:48,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:48,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 178 [2025-03-15 01:24:48,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:48,623 INFO L124 PetriNetUnfolderBase]: 157/2571 cut-off events. [2025-03-15 01:24:48,623 INFO L125 PetriNetUnfolderBase]: For 5145/5145 co-relation queries the response was YES. [2025-03-15 01:24:48,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8023 conditions, 2571 events. 157/2571 cut-off events. For 5145/5145 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21717 event pairs, 0 based on Foata normal form. 0/2167 useless extension candidates. Maximal degree in co-relation 3757. Up to 535 conditions per place. [2025-03-15 01:24:48,637 INFO L140 encePairwiseOnDemand]: 166/178 looper letters, 129 selfloop transitions, 11 changer transitions 37/277 dead transitions. [2025-03-15 01:24:48,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 277 transitions, 2450 flow [2025-03-15 01:24:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2025-03-15 01:24:48,640 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.851123595505618 [2025-03-15 01:24:48,641 INFO L298 CegarLoopForPetriNet]: 170 programPoint places, 23 predicate places. [2025-03-15 01:24:48,641 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 277 transitions, 2450 flow [2025-03-15 01:24:48,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 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:24:48,641 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:48,642 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:48,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:24:48,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:48,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1253015326, now seen corresponding path program 1 times [2025-03-15 01:24:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:48,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617077229] [2025-03-15 01:24:48,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:48,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:48,661 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:24:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:48,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:24:48,684 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:24:48,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:24:48,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:24:48,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:24:48,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:24:48,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:24:48,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:24:48,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:24:48,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:24:48,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:24:48,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:24:48,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:24:48,685 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:48,686 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:24:48,686 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 01:24:48,710 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-15 01:24:48,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:48,716 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;@3e86739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:48,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:24:48,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:48,721 INFO L124 PetriNetUnfolderBase]: 4/93 cut-off events. [2025-03-15 01:24:48,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:24:48,721 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:48,721 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:48,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:48,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -401145007, now seen corresponding path program 1 times [2025-03-15 01:24:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445620588] [2025-03-15 01:24:48,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:48,764 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:24:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445620588] [2025-03-15 01:24:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445620588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480116948] [2025-03-15 01:24:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:48,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:48,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:48,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:48,770 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:48,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 200 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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:24:48,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:48,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:48,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:49,310 INFO L124 PetriNetUnfolderBase]: 565/5799 cut-off events. [2025-03-15 01:24:49,311 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2025-03-15 01:24:49,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8473 conditions, 5799 events. 565/5799 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 55775 event pairs, 8 based on Foata normal form. 2301/7168 useless extension candidates. Maximal degree in co-relation 4286. Up to 1300 conditions per place. [2025-03-15 01:24:49,328 INFO L140 encePairwiseOnDemand]: 178/200 looper letters, 75 selfloop transitions, 10 changer transitions 34/227 dead transitions. [2025-03-15 01:24:49,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 227 transitions, 740 flow [2025-03-15 01:24:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2025-03-15 01:24:49,330 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.797 [2025-03-15 01:24:49,330 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 1 predicate places. [2025-03-15 01:24:49,330 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 227 transitions, 740 flow [2025-03-15 01:24:49,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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:24:49,331 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:49,331 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:49,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:24:49,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1944738513, now seen corresponding path program 1 times [2025-03-15 01:24:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294363168] [2025-03-15 01:24:49,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:49,375 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:24:49,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294363168] [2025-03-15 01:24:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294363168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:49,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037854503] [2025-03-15 01:24:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:49,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:49,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:49,378 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:49,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 227 transitions, 740 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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:24:49,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:49,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:50,569 INFO L124 PetriNetUnfolderBase]: 1071/10988 cut-off events. [2025-03-15 01:24:50,570 INFO L125 PetriNetUnfolderBase]: For 2663/2663 co-relation queries the response was YES. [2025-03-15 01:24:50,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19904 conditions, 10988 events. 1071/10988 cut-off events. For 2663/2663 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 124617 event pairs, 17 based on Foata normal form. 0/9238 useless extension candidates. Maximal degree in co-relation 9833. Up to 2487 conditions per place. [2025-03-15 01:24:50,607 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 144 selfloop transitions, 10 changer transitions 39/305 dead transitions. [2025-03-15 01:24:50,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 305 transitions, 1476 flow [2025-03-15 01:24:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions. [2025-03-15 01:24:50,611 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8525 [2025-03-15 01:24:50,611 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 4 predicate places. [2025-03-15 01:24:50,611 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 305 transitions, 1476 flow [2025-03-15 01:24:50,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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:24:50,612 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:50,612 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:50,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:24:50,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 494029411, now seen corresponding path program 1 times [2025-03-15 01:24:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368450893] [2025-03-15 01:24:50,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:50,664 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:24:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368450893] [2025-03-15 01:24:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368450893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:50,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:50,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927203378] [2025-03-15 01:24:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:50,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:50,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:50,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:50,666 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:50,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 305 transitions, 1476 flow. Second operand has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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:24:50,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:50,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:50,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:51,700 INFO L124 PetriNetUnfolderBase]: 1071/10974 cut-off events. [2025-03-15 01:24:51,701 INFO L125 PetriNetUnfolderBase]: For 5427/5427 co-relation queries the response was YES. [2025-03-15 01:24:51,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23787 conditions, 10974 events. 1071/10974 cut-off events. For 5427/5427 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 124479 event pairs, 17 based on Foata normal form. 0/9238 useless extension candidates. Maximal degree in co-relation 11735. Up to 2537 conditions per place. [2025-03-15 01:24:51,741 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 137 selfloop transitions, 19 changer transitions 39/308 dead transitions. [2025-03-15 01:24:51,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 308 transitions, 1810 flow [2025-03-15 01:24:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2025-03-15 01:24:51,743 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.781 [2025-03-15 01:24:51,744 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 8 predicate places. [2025-03-15 01:24:51,744 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 308 transitions, 1810 flow [2025-03-15 01:24:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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:24:51,744 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:51,744 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:24:51,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 983801404, now seen corresponding path program 1 times [2025-03-15 01:24:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590707269] [2025-03-15 01:24:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:51,820 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:24:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590707269] [2025-03-15 01:24:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590707269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664379806] [2025-03-15 01:24:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:51,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:51,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:51,821 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:51,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 308 transitions, 1810 flow. Second operand has 6 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 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:24:51,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:51,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:53,298 INFO L124 PetriNetUnfolderBase]: 1071/10970 cut-off events. [2025-03-15 01:24:53,298 INFO L125 PetriNetUnfolderBase]: For 9639/9639 co-relation queries the response was YES. [2025-03-15 01:24:53,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27607 conditions, 10970 events. 1071/10970 cut-off events. For 9639/9639 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 124501 event pairs, 17 based on Foata normal form. 0/9238 useless extension candidates. Maximal degree in co-relation 13609. Up to 2537 conditions per place. [2025-03-15 01:24:53,360 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 133 selfloop transitions, 22 changer transitions 39/307 dead transitions. [2025-03-15 01:24:53,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 307 transitions, 2132 flow [2025-03-15 01:24:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1055 transitions. [2025-03-15 01:24:53,363 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7535714285714286 [2025-03-15 01:24:53,363 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 13 predicate places. [2025-03-15 01:24:53,363 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 307 transitions, 2132 flow [2025-03-15 01:24:53,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 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:24:53,363 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:53,364 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:53,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:24:53,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:53,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash 433073135, now seen corresponding path program 1 times [2025-03-15 01:24:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:53,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120496315] [2025-03-15 01:24:53,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:53,432 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:24:53,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:53,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120496315] [2025-03-15 01:24:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120496315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:53,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838851414] [2025-03-15 01:24:53,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:53,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:53,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:53,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:53,434 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:53,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 307 transitions, 2132 flow. Second operand has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 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:24:53,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:53,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:53,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:54,546 INFO L124 PetriNetUnfolderBase]: 1071/10968 cut-off events. [2025-03-15 01:24:54,547 INFO L125 PetriNetUnfolderBase]: For 15269/15269 co-relation queries the response was YES. [2025-03-15 01:24:54,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31427 conditions, 10968 events. 1071/10968 cut-off events. For 15269/15269 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 124350 event pairs, 17 based on Foata normal form. 0/9238 useless extension candidates. Maximal degree in co-relation 15483. Up to 2537 conditions per place. [2025-03-15 01:24:54,613 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 144 selfloop transitions, 26 changer transitions 39/322 dead transitions. [2025-03-15 01:24:54,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 322 transitions, 2626 flow [2025-03-15 01:24:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1202 transitions. [2025-03-15 01:24:54,617 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.75125 [2025-03-15 01:24:54,617 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 20 predicate places. [2025-03-15 01:24:54,617 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 322 transitions, 2626 flow [2025-03-15 01:24:54,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 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:24:54,618 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:54,618 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:24:54,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1920401105, now seen corresponding path program 1 times [2025-03-15 01:24:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243565444] [2025-03-15 01:24:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:54,668 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:24:54,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:54,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243565444] [2025-03-15 01:24:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243565444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:54,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27214777] [2025-03-15 01:24:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:54,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:54,669 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:54,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 322 transitions, 2626 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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:24:54,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:54,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:54,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:55,724 INFO L124 PetriNetUnfolderBase]: 1008/10382 cut-off events. [2025-03-15 01:24:55,724 INFO L125 PetriNetUnfolderBase]: For 21262/21262 co-relation queries the response was YES. [2025-03-15 01:24:55,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33737 conditions, 10382 events. 1008/10382 cut-off events. For 21262/21262 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 116966 event pairs, 18 based on Foata normal form. 0/8730 useless extension candidates. Maximal degree in co-relation 16489. Up to 2470 conditions per place. [2025-03-15 01:24:55,781 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 153 selfloop transitions, 11 changer transitions 37/319 dead transitions. [2025-03-15 01:24:55,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 319 transitions, 2924 flow [2025-03-15 01:24:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2025-03-15 01:24:55,783 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8475 [2025-03-15 01:24:55,783 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 23 predicate places. [2025-03-15 01:24:55,783 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 319 transitions, 2924 flow [2025-03-15 01:24:55,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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:24:55,784 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:55,784 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:55,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:24:55,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1654588318, now seen corresponding path program 1 times [2025-03-15 01:24:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185805126] [2025-03-15 01:24:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:55,854 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:24:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185805126] [2025-03-15 01:24:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185805126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443816562] [2025-03-15 01:24:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:55,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:55,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:55,856 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:55,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 319 transitions, 2924 flow. Second operand has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:24:55,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:55,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:55,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:57,005 INFO L124 PetriNetUnfolderBase]: 1008/10368 cut-off events. [2025-03-15 01:24:57,006 INFO L125 PetriNetUnfolderBase]: For 29126/29126 co-relation queries the response was YES. [2025-03-15 01:24:57,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37440 conditions, 10368 events. 1008/10368 cut-off events. For 29126/29126 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 116705 event pairs, 18 based on Foata normal form. 0/8730 useless extension candidates. Maximal degree in co-relation 18296. Up to 2456 conditions per place. [2025-03-15 01:24:57,071 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 141 selfloop transitions, 24 changer transitions 37/318 dead transitions. [2025-03-15 01:24:57,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 318 transitions, 3262 flow [2025-03-15 01:24:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1055 transitions. [2025-03-15 01:24:57,073 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7535714285714286 [2025-03-15 01:24:57,073 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 28 predicate places. [2025-03-15 01:24:57,073 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 318 transitions, 3262 flow [2025-03-15 01:24:57,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:24:57,074 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:57,074 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:57,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:24:57,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash -247369029, now seen corresponding path program 1 times [2025-03-15 01:24:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:57,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405316097] [2025-03-15 01:24:57,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:57,139 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:24:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405316097] [2025-03-15 01:24:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405316097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001302031] [2025-03-15 01:24:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:57,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:57,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:57,140 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:57,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 318 transitions, 3262 flow. Second operand has 6 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 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:24:57,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:57,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:57,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:58,585 INFO L124 PetriNetUnfolderBase]: 1008/10361 cut-off events. [2025-03-15 01:24:58,586 INFO L125 PetriNetUnfolderBase]: For 38307/38307 co-relation queries the response was YES. [2025-03-15 01:24:58,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41143 conditions, 10361 events. 1008/10361 cut-off events. For 38307/38307 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 116642 event pairs, 18 based on Foata normal form. 0/8730 useless extension candidates. Maximal degree in co-relation 20089. Up to 2449 conditions per place. [2025-03-15 01:24:58,668 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 152 selfloop transitions, 28 changer transitions 37/333 dead transitions. [2025-03-15 01:24:58,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 333 transitions, 3844 flow [2025-03-15 01:24:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1202 transitions. [2025-03-15 01:24:58,671 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.75125 [2025-03-15 01:24:58,671 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 35 predicate places. [2025-03-15 01:24:58,671 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 333 transitions, 3844 flow [2025-03-15 01:24:58,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 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:24:58,672 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:58,672 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:24:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:24:58,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 369371779, now seen corresponding path program 1 times [2025-03-15 01:24:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586742502] [2025-03-15 01:24:58,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:58,759 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:24:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586742502] [2025-03-15 01:24:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586742502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:24:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926497772] [2025-03-15 01:24:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:58,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:24:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:58,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:24:58,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:24:58,761 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:24:58,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 333 transitions, 3844 flow. Second operand has 8 states, 8 states have (on average 141.125) internal successors, (1129), 8 states have internal predecessors, (1129), 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:24:58,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:58,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:24:58,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:00,076 INFO L124 PetriNetUnfolderBase]: 1008/10359 cut-off events. [2025-03-15 01:25:00,076 INFO L125 PetriNetUnfolderBase]: For 48955/48955 co-relation queries the response was YES. [2025-03-15 01:25:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44807 conditions, 10359 events. 1008/10359 cut-off events. For 48955/48955 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 116762 event pairs, 18 based on Foata normal form. 0/8730 useless extension candidates. Maximal degree in co-relation 21871. Up to 2449 conditions per place. [2025-03-15 01:25:00,126 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 152 selfloop transitions, 35 changer transitions 37/340 dead transitions. [2025-03-15 01:25:00,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 340 transitions, 4366 flow [2025-03-15 01:25:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:25:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:25:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1619 transitions. [2025-03-15 01:25:00,129 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.735909090909091 [2025-03-15 01:25:00,129 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 44 predicate places. [2025-03-15 01:25:00,129 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 340 transitions, 4366 flow [2025-03-15 01:25:00,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 141.125) internal successors, (1129), 8 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:00,130 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:00,130 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:00,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:25:00,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:00,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash -276335633, now seen corresponding path program 1 times [2025-03-15 01:25:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:00,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729374509] [2025-03-15 01:25:00,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:00,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:00,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729374509] [2025-03-15 01:25:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729374509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366089239] [2025-03-15 01:25:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:00,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:00,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:00,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:00,172 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:25:00,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 340 transitions, 4366 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:00,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:00,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:25:00,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:01,460 INFO L124 PetriNetUnfolderBase]: 1008/10276 cut-off events. [2025-03-15 01:25:01,460 INFO L125 PetriNetUnfolderBase]: For 58211/58211 co-relation queries the response was YES. [2025-03-15 01:25:01,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49161 conditions, 10276 events. 1008/10276 cut-off events. For 58211/58211 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 115450 event pairs, 18 based on Foata normal form. 0/8789 useless extension candidates. Maximal degree in co-relation 23979. Up to 2970 conditions per place. [2025-03-15 01:25:01,537 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 161 selfloop transitions, 25 changer transitions 37/343 dead transitions. [2025-03-15 01:25:01,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 343 transitions, 4756 flow [2025-03-15 01:25:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2025-03-15 01:25:01,538 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.781 [2025-03-15 01:25:01,538 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 48 predicate places. [2025-03-15 01:25:01,538 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 343 transitions, 4756 flow [2025-03-15 01:25:01,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:01,539 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:01,539 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:01,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:25:01,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1029295445, now seen corresponding path program 1 times [2025-03-15 01:25:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835796739] [2025-03-15 01:25:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835796739] [2025-03-15 01:25:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835796739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:01,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:01,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364008422] [2025-03-15 01:25:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:01,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:01,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:01,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:01,573 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 200 [2025-03-15 01:25:01,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 343 transitions, 4756 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:01,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:01,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 200 [2025-03-15 01:25:01,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:02,871 INFO L124 PetriNetUnfolderBase]: 1008/10135 cut-off events. [2025-03-15 01:25:02,871 INFO L125 PetriNetUnfolderBase]: For 67924/67924 co-relation queries the response was YES. [2025-03-15 01:25:02,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53529 conditions, 10135 events. 1008/10135 cut-off events. For 67924/67924 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 113314 event pairs, 18 based on Foata normal form. 0/8888 useless extension candidates. Maximal degree in co-relation 26060. Up to 2970 conditions per place. [2025-03-15 01:25:02,948 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 161 selfloop transitions, 25 changer transitions 37/346 dead transitions. [2025-03-15 01:25:02,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 346 transitions, 5146 flow [2025-03-15 01:25:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2025-03-15 01:25:02,949 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.781 [2025-03-15 01:25:02,950 INFO L298 CegarLoopForPetriNet]: 191 programPoint places, 52 predicate places. [2025-03-15 01:25:02,950 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 346 transitions, 5146 flow [2025-03-15 01:25:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:02,950 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:02,950 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 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] [2025-03-15 01:25:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:25:02,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 203315904, now seen corresponding path program 1 times [2025-03-15 01:25:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067395109] [2025-03-15 01:25:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:25:02,966 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:25:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:25:02,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:25:02,984 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:25:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:25:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:25:02,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:02,985 WARN L336 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:25:02,985 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-15 01:25:03,003 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-03-15 01:25:03,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:25:03,006 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;@3e86739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:25:03,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:25:03,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:25:03,009 INFO L124 PetriNetUnfolderBase]: 4/92 cut-off events. [2025-03-15 01:25:03,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:25:03,009 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:03,009 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:03,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:03,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash -155647939, now seen corresponding path program 1 times [2025-03-15 01:25:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83586251] [2025-03-15 01:25:03,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83586251] [2025-03-15 01:25:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83586251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:03,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771896474] [2025-03-15 01:25:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:03,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:03,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:03,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:03,035 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:03,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 222 transitions, 548 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:03,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:03,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:04,987 INFO L124 PetriNetUnfolderBase]: 2926/22067 cut-off events. [2025-03-15 01:25:04,987 INFO L125 PetriNetUnfolderBase]: For 3252/3252 co-relation queries the response was YES. [2025-03-15 01:25:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33516 conditions, 22067 events. 2926/22067 cut-off events. For 3252/3252 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 264806 event pairs, 284 based on Foata normal form. 11251/29905 useless extension candidates. Maximal degree in co-relation 16733. Up to 5550 conditions per place. [2025-03-15 01:25:05,164 INFO L140 encePairwiseOnDemand]: 199/222 looper letters, 85 selfloop transitions, 10 changer transitions 34/251 dead transitions. [2025-03-15 01:25:05,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 251 transitions, 852 flow [2025-03-15 01:25:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2025-03-15 01:25:05,165 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7918918918918919 [2025-03-15 01:25:05,166 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 0 predicate places. [2025-03-15 01:25:05,166 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 251 transitions, 852 flow [2025-03-15 01:25:05,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:05,166 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:05,166 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:25:05,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:05,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1593579650, now seen corresponding path program 1 times [2025-03-15 01:25:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892538406] [2025-03-15 01:25:05,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892538406] [2025-03-15 01:25:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892538406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:25:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726476928] [2025-03-15 01:25:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:05,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:05,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:05,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:05,205 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:05,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 251 transitions, 852 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:05,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:05,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:05,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:09,730 INFO L124 PetriNetUnfolderBase]: 5752/43184 cut-off events. [2025-03-15 01:25:09,730 INFO L125 PetriNetUnfolderBase]: For 11862/11862 co-relation queries the response was YES. [2025-03-15 01:25:09,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81775 conditions, 43184 events. 5752/43184 cut-off events. For 11862/11862 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 593588 event pairs, 431 based on Foata normal form. 0/36542 useless extension candidates. Maximal degree in co-relation 40262. Up to 10916 conditions per place. [2025-03-15 01:25:10,038 INFO L140 encePairwiseOnDemand]: 209/222 looper letters, 164 selfloop transitions, 10 changer transitions 39/339 dead transitions. [2025-03-15 01:25:10,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 339 transitions, 1710 flow [2025-03-15 01:25:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:25:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:25:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 754 transitions. [2025-03-15 01:25:10,040 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8490990990990991 [2025-03-15 01:25:10,040 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 3 predicate places. [2025-03-15 01:25:10,040 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 339 transitions, 1710 flow [2025-03-15 01:25:10,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:10,040 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:10,040 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:10,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 01:25:10,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1402032692, now seen corresponding path program 1 times [2025-03-15 01:25:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:10,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615055955] [2025-03-15 01:25:10,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:10,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615055955] [2025-03-15 01:25:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615055955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:10,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:10,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108480960] [2025-03-15 01:25:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:10,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:10,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:10,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:10,076 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:10,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 339 transitions, 1710 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:10,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:10,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:10,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:15,331 INFO L124 PetriNetUnfolderBase]: 5752/43166 cut-off events. [2025-03-15 01:25:15,331 INFO L125 PetriNetUnfolderBase]: For 22630/22630 co-relation queries the response was YES. [2025-03-15 01:25:15,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97992 conditions, 43166 events. 5752/43166 cut-off events. For 22630/22630 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 593686 event pairs, 431 based on Foata normal form. 0/36542 useless extension candidates. Maximal degree in co-relation 48171. Up to 11021 conditions per place. [2025-03-15 01:25:15,612 INFO L140 encePairwiseOnDemand]: 209/222 looper letters, 157 selfloop transitions, 19 changer transitions 39/342 dead transitions. [2025-03-15 01:25:15,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 342 transitions, 2084 flow [2025-03-15 01:25:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 861 transitions. [2025-03-15 01:25:15,613 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7756756756756756 [2025-03-15 01:25:15,614 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 7 predicate places. [2025-03-15 01:25:15,614 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 342 transitions, 2084 flow [2025-03-15 01:25:15,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:15,614 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:15,614 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:15,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:25:15,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:15,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash -94068040, now seen corresponding path program 1 times [2025-03-15 01:25:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540134313] [2025-03-15 01:25:15,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540134313] [2025-03-15 01:25:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540134313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546290084] [2025-03-15 01:25:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:15,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:15,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:15,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:15,660 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:15,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 342 transitions, 2084 flow. Second operand has 6 states, 6 states have (on average 154.66666666666666) internal successors, (928), 6 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:15,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:15,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:15,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:21,157 INFO L124 PetriNetUnfolderBase]: 5752/43160 cut-off events. [2025-03-15 01:25:21,158 INFO L125 PetriNetUnfolderBase]: For 38902/38902 co-relation queries the response was YES. [2025-03-15 01:25:21,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114083 conditions, 43160 events. 5752/43160 cut-off events. For 38902/38902 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 593507 event pairs, 431 based on Foata normal form. 0/36542 useless extension candidates. Maximal degree in co-relation 55999. Up to 11021 conditions per place. [2025-03-15 01:25:21,629 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 153 selfloop transitions, 22 changer transitions 39/341 dead transitions. [2025-03-15 01:25:21,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 341 transitions, 2446 flow [2025-03-15 01:25:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1163 transitions. [2025-03-15 01:25:21,630 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7483912483912484 [2025-03-15 01:25:21,631 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 12 predicate places. [2025-03-15 01:25:21,631 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 341 transitions, 2446 flow [2025-03-15 01:25:21,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.66666666666666) internal successors, (928), 6 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:21,631 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:21,631 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:21,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 01:25:21,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:21,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1378858959, now seen corresponding path program 1 times [2025-03-15 01:25:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:21,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486383227] [2025-03-15 01:25:21,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486383227] [2025-03-15 01:25:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486383227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831055492] [2025-03-15 01:25:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:21,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:21,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:21,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:21,685 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:21,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 341 transitions, 2446 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:21,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:21,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:21,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:27,346 INFO L124 PetriNetUnfolderBase]: 5752/43158 cut-off events. [2025-03-15 01:25:27,347 INFO L125 PetriNetUnfolderBase]: For 60622/60622 co-relation queries the response was YES. [2025-03-15 01:25:27,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130178 conditions, 43158 events. 5752/43158 cut-off events. For 60622/60622 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 593443 event pairs, 431 based on Foata normal form. 0/36542 useless extension candidates. Maximal degree in co-relation 63831. Up to 11021 conditions per place. [2025-03-15 01:25:27,696 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 164 selfloop transitions, 26 changer transitions 39/356 dead transitions. [2025-03-15 01:25:27,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 356 transitions, 2980 flow [2025-03-15 01:25:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1324 transitions. [2025-03-15 01:25:27,698 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7454954954954955 [2025-03-15 01:25:27,699 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 19 predicate places. [2025-03-15 01:25:27,699 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 356 transitions, 2980 flow [2025-03-15 01:25:27,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:27,699 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:27,700 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:27,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 01:25:27,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1888962936, now seen corresponding path program 1 times [2025-03-15 01:25:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982706373] [2025-03-15 01:25:27,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982706373] [2025-03-15 01:25:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982706373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:27,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:27,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:25:27,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190474381] [2025-03-15 01:25:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:27,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:27,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:27,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:27,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:27,766 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:27,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 356 transitions, 2980 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:27,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:27,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:27,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:33,305 INFO L124 PetriNetUnfolderBase]: 5495/40985 cut-off events. [2025-03-15 01:25:33,305 INFO L125 PetriNetUnfolderBase]: For 83769/83769 co-relation queries the response was YES. [2025-03-15 01:25:33,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140776 conditions, 40985 events. 5495/40985 cut-off events. For 83769/83769 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 560349 event pairs, 436 based on Foata normal form. 0/34649 useless extension candidates. Maximal degree in co-relation 68728. Up to 10759 conditions per place. [2025-03-15 01:25:33,670 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 173 selfloop transitions, 11 changer transitions 37/353 dead transitions. [2025-03-15 01:25:33,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 353 transitions, 3318 flow [2025-03-15 01:25:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:25:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:25:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 750 transitions. [2025-03-15 01:25:33,672 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8445945945945946 [2025-03-15 01:25:33,672 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 22 predicate places. [2025-03-15 01:25:33,672 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 353 transitions, 3318 flow [2025-03-15 01:25:33,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:33,672 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:33,672 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:33,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 01:25:33,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash 326097280, now seen corresponding path program 1 times [2025-03-15 01:25:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:33,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587313013] [2025-03-15 01:25:33,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587313013] [2025-03-15 01:25:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587313013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972984502] [2025-03-15 01:25:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:33,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:33,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:33,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:33,731 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:33,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 353 transitions, 3318 flow. Second operand has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:33,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:33,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:33,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:39,560 INFO L124 PetriNetUnfolderBase]: 5495/40958 cut-off events. [2025-03-15 01:25:39,560 INFO L125 PetriNetUnfolderBase]: For 114457/114457 co-relation queries the response was YES. [2025-03-15 01:25:39,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156380 conditions, 40958 events. 5495/40958 cut-off events. For 114457/114457 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 559820 event pairs, 294 based on Foata normal form. 0/34649 useless extension candidates. Maximal degree in co-relation 76307. Up to 10732 conditions per place. [2025-03-15 01:25:39,865 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 161 selfloop transitions, 24 changer transitions 37/352 dead transitions. [2025-03-15 01:25:39,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 352 transitions, 3696 flow [2025-03-15 01:25:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1163 transitions. [2025-03-15 01:25:39,866 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7483912483912484 [2025-03-15 01:25:39,867 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 27 predicate places. [2025-03-15 01:25:39,867 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 352 transitions, 3696 flow [2025-03-15 01:25:39,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:39,867 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:39,867 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 01:25:39,867 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1519081973, now seen corresponding path program 1 times [2025-03-15 01:25:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668805638] [2025-03-15 01:25:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668805638] [2025-03-15 01:25:39,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668805638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:39,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920915690] [2025-03-15 01:25:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:39,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:39,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:39,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:39,907 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:39,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 352 transitions, 3696 flow. Second operand has 6 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:45,755 INFO L124 PetriNetUnfolderBase]: 5495/40949 cut-off events. [2025-03-15 01:25:45,756 INFO L125 PetriNetUnfolderBase]: For 150268/150268 co-relation queries the response was YES. [2025-03-15 01:25:45,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172002 conditions, 40949 events. 5495/40949 cut-off events. For 150268/150268 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 559950 event pairs, 436 based on Foata normal form. 0/34649 useless extension candidates. Maximal degree in co-relation 83886. Up to 10723 conditions per place. [2025-03-15 01:25:46,083 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 172 selfloop transitions, 28 changer transitions 37/367 dead transitions. [2025-03-15 01:25:46,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 367 transitions, 4318 flow [2025-03-15 01:25:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1324 transitions. [2025-03-15 01:25:46,084 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7454954954954955 [2025-03-15 01:25:46,085 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 34 predicate places. [2025-03-15 01:25:46,085 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 367 transitions, 4318 flow [2025-03-15 01:25:46,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:46,085 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:46,085 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:25:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 01:25:46,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 981638355, now seen corresponding path program 1 times [2025-03-15 01:25:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746835088] [2025-03-15 01:25:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746835088] [2025-03-15 01:25:46,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746835088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:46,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:46,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:25:46,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467482747] [2025-03-15 01:25:46,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:46,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:25:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:46,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:25:46,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:46,140 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:46,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 367 transitions, 4318 flow. Second operand has 8 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:46,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:46,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:52,496 INFO L124 PetriNetUnfolderBase]: 5495/40947 cut-off events. [2025-03-15 01:25:52,496 INFO L125 PetriNetUnfolderBase]: For 191482/191482 co-relation queries the response was YES. [2025-03-15 01:25:52,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187543 conditions, 40947 events. 5495/40947 cut-off events. For 191482/191482 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 559908 event pairs, 294 based on Foata normal form. 0/34649 useless extension candidates. Maximal degree in co-relation 91420. Up to 10723 conditions per place. [2025-03-15 01:25:52,871 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 180 selfloop transitions, 35 changer transitions 37/382 dead transitions. [2025-03-15 01:25:52,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 382 transitions, 5000 flow [2025-03-15 01:25:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:25:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:25:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1789 transitions. [2025-03-15 01:25:52,873 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7325962325962326 [2025-03-15 01:25:52,873 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 44 predicate places. [2025-03-15 01:25:52,873 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 382 transitions, 5000 flow [2025-03-15 01:25:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:52,874 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:52,874 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:52,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 01:25:52,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2019181240, now seen corresponding path program 1 times [2025-03-15 01:25:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734096758] [2025-03-15 01:25:52,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734096758] [2025-03-15 01:25:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734096758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381966508] [2025-03-15 01:25:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:52,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:52,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:52,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:52,903 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:25:52,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 382 transitions, 5000 flow. Second operand has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:52,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:52,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:25:52,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:59,459 INFO L124 PetriNetUnfolderBase]: 5495/40776 cut-off events. [2025-03-15 01:25:59,459 INFO L125 PetriNetUnfolderBase]: For 227524/227524 co-relation queries the response was YES. [2025-03-15 01:25:59,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205830 conditions, 40776 events. 5495/40776 cut-off events. For 227524/227524 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 557172 event pairs, 436 based on Foata normal form. 0/34788 useless extension candidates. Maximal degree in co-relation 100334. Up to 13094 conditions per place. [2025-03-15 01:25:59,877 INFO L140 encePairwiseOnDemand]: 209/222 looper letters, 185 selfloop transitions, 25 changer transitions 37/385 dead transitions. [2025-03-15 01:25:59,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 385 transitions, 5438 flow [2025-03-15 01:25:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 861 transitions. [2025-03-15 01:25:59,878 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7756756756756756 [2025-03-15 01:25:59,879 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 48 predicate places. [2025-03-15 01:25:59,879 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 385 transitions, 5438 flow [2025-03-15 01:25:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:59,879 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:59,879 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 01:25:59,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:59,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -622353188, now seen corresponding path program 1 times [2025-03-15 01:25:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113765015] [2025-03-15 01:25:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:00,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113765015] [2025-03-15 01:26:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113765015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:00,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199842270] [2025-03-15 01:26:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:00,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:00,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:00,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:00,065 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:26:00,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 385 transitions, 5438 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:00,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:00,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:26:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:07,164 INFO L124 PetriNetUnfolderBase]: 5495/40238 cut-off events. [2025-03-15 01:26:07,164 INFO L125 PetriNetUnfolderBase]: For 263333/263333 co-relation queries the response was YES. [2025-03-15 01:26:07,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224651 conditions, 40238 events. 5495/40238 cut-off events. For 263333/263333 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 546943 event pairs, 294 based on Foata normal form. 0/35254 useless extension candidates. Maximal degree in co-relation 109411. Up to 13094 conditions per place. [2025-03-15 01:26:07,598 INFO L140 encePairwiseOnDemand]: 209/222 looper letters, 185 selfloop transitions, 25 changer transitions 37/388 dead transitions. [2025-03-15 01:26:07,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 388 transitions, 5876 flow [2025-03-15 01:26:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 861 transitions. [2025-03-15 01:26:07,600 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7756756756756756 [2025-03-15 01:26:07,600 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 52 predicate places. [2025-03-15 01:26:07,600 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 388 transitions, 5876 flow [2025-03-15 01:26:07,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:07,600 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:07,601 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:26:07,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 01:26:07,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1847393800, now seen corresponding path program 1 times [2025-03-15 01:26:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565084674] [2025-03-15 01:26:07,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:07,672 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:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565084674] [2025-03-15 01:26:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565084674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:07,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:07,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:26:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683196533] [2025-03-15 01:26:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:07,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:26:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:07,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:26:07,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:26:07,675 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:26:07,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 388 transitions, 5876 flow. Second operand has 8 states, 8 states have (on average 155.375) internal successors, (1243), 8 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:07,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:07,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:26:07,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:14,909 INFO L124 PetriNetUnfolderBase]: 5495/40229 cut-off events. [2025-03-15 01:26:14,909 INFO L125 PetriNetUnfolderBase]: For 316991/316991 co-relation queries the response was YES. [2025-03-15 01:26:15,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240255 conditions, 40229 events. 5495/40229 cut-off events. For 316991/316991 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 546961 event pairs, 436 based on Foata normal form. 0/35254 useless extension candidates. Maximal degree in co-relation 116972. Up to 13094 conditions per place. [2025-03-15 01:26:15,335 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 190 selfloop transitions, 37 changer transitions 37/403 dead transitions. [2025-03-15 01:26:15,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 403 transitions, 6654 flow [2025-03-15 01:26:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:26:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:26:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1789 transitions. [2025-03-15 01:26:15,337 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7325962325962326 [2025-03-15 01:26:15,337 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 62 predicate places. [2025-03-15 01:26:15,337 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 403 transitions, 6654 flow [2025-03-15 01:26:15,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 155.375) internal successors, (1243), 8 states have internal predecessors, (1243), 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:15,338 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:15,338 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-15 01:26:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 01:26:15,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1085249462, now seen corresponding path program 1 times [2025-03-15 01:26:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731579606] [2025-03-15 01:26:15,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:15,417 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:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731579606] [2025-03-15 01:26:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731579606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:15,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:26:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220576747] [2025-03-15 01:26:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:15,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:15,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:15,418 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:26:15,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 403 transitions, 6654 flow. Second operand has 10 states, 10 states have (on average 155.3) internal successors, (1553), 10 states have internal predecessors, (1553), 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:15,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:15,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:26:15,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:22,739 INFO L124 PetriNetUnfolderBase]: 5495/40227 cut-off events. [2025-03-15 01:26:22,740 INFO L125 PetriNetUnfolderBase]: For 376220/376220 co-relation queries the response was YES. [2025-03-15 01:26:22,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255792 conditions, 40227 events. 5495/40227 cut-off events. For 376220/376220 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 546983 event pairs, 294 based on Foata normal form. 0/35254 useless extension candidates. Maximal degree in co-relation 124502. Up to 13094 conditions per place. [2025-03-15 01:26:23,363 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 190 selfloop transitions, 44 changer transitions 37/410 dead transitions. [2025-03-15 01:26:23,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 410 transitions, 7332 flow [2025-03-15 01:26:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 01:26:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 01:26:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2248 transitions. [2025-03-15 01:26:23,365 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7232947232947233 [2025-03-15 01:26:23,365 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 74 predicate places. [2025-03-15 01:26:23,365 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 410 transitions, 7332 flow [2025-03-15 01:26:23,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 155.3) internal successors, (1553), 10 states have internal predecessors, (1553), 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:23,366 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:23,366 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:23,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 01:26:23,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:23,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 651353241, now seen corresponding path program 1 times [2025-03-15 01:26:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:23,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463062623] [2025-03-15 01:26:23,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:23,469 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:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463062623] [2025-03-15 01:26:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463062623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 01:26:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309599886] [2025-03-15 01:26:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:23,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:26:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:23,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:26:23,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:26:23,471 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 222 [2025-03-15 01:26:23,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 410 transitions, 7332 flow. Second operand has 12 states, 12 states have (on average 150.33333333333334) internal successors, (1804), 12 states have internal predecessors, (1804), 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:23,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:23,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 222 [2025-03-15 01:26:23,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:31,032 INFO L124 PetriNetUnfolderBase]: 5495/40222 cut-off events. [2025-03-15 01:26:31,032 INFO L125 PetriNetUnfolderBase]: For 440537/440537 co-relation queries the response was YES. [2025-03-15 01:26:31,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271314 conditions, 40222 events. 5495/40222 cut-off events. For 440537/440537 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 546931 event pairs, 436 based on Foata normal form. 0/35250 useless extension candidates. Maximal degree in co-relation 132017. Up to 13092 conditions per place. [2025-03-15 01:26:31,657 INFO L140 encePairwiseOnDemand]: 207/222 looper letters, 206 selfloop transitions, 44 changer transitions 37/420 dead transitions. [2025-03-15 01:26:31,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 420 transitions, 7936 flow [2025-03-15 01:26:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 01:26:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 01:26:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2666 transitions. [2025-03-15 01:26:31,659 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7064122946475888 [2025-03-15 01:26:31,659 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 90 predicate places. [2025-03-15 01:26:31,660 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 420 transitions, 7936 flow [2025-03-15 01:26:31,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 150.33333333333334) internal successors, (1804), 12 states have internal predecessors, (1804), 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:31,660 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:31,660 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:31,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 01:26:31,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1212032156, now seen corresponding path program 1 times [2025-03-15 01:26:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498485962] [2025-03-15 01:26:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:31,731 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:31,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:31,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498485962] [2025-03-15 01:26:31,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498485962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:31,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:31,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:26:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510145707] [2025-03-15 01:26:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:31,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:26:31,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:31,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:26:31,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:26:31,733 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 222 [2025-03-15 01:26:31,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 420 transitions, 7936 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 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:31,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:31,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 222 [2025-03-15 01:26:31,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:39,441 INFO L124 PetriNetUnfolderBase]: 5481/39940 cut-off events. [2025-03-15 01:26:39,441 INFO L125 PetriNetUnfolderBase]: For 506549/506549 co-relation queries the response was YES. [2025-03-15 01:26:39,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285332 conditions, 39940 events. 5481/39940 cut-off events. For 506549/506549 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 544212 event pairs, 311 based on Foata normal form. 0/34993 useless extension candidates. Maximal degree in co-relation 138483. Up to 13058 conditions per place. [2025-03-15 01:26:39,884 INFO L140 encePairwiseOnDemand]: 209/222 looper letters, 231 selfloop transitions, 17 changer transitions 37/418 dead transitions. [2025-03-15 01:26:39,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 418 transitions, 8388 flow [2025-03-15 01:26:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:26:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:26:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1185 transitions. [2025-03-15 01:26:39,885 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7625482625482626 [2025-03-15 01:26:39,885 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 96 predicate places. [2025-03-15 01:26:39,885 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 418 transitions, 8388 flow [2025-03-15 01:26:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 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:39,886 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:39,886 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 01:26:39,886 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:39,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:39,886 INFO L85 PathProgramCache]: Analyzing trace with hash 321499578, now seen corresponding path program 1 times [2025-03-15 01:26:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318824294] [2025-03-15 01:26:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:40,114 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,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318824294] [2025-03-15 01:26:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318824294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:26:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534509774] [2025-03-15 01:26:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:40,115 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 222 [2025-03-15 01:26:40,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 418 transitions, 8388 flow. Second operand has 10 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 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,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:40,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 222 [2025-03-15 01:26:40,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:48,251 INFO L124 PetriNetUnfolderBase]: 5481/39932 cut-off events. [2025-03-15 01:26:48,251 INFO L125 PetriNetUnfolderBase]: For 580182/580182 co-relation queries the response was YES. [2025-03-15 01:26:48,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300833 conditions, 39932 events. 5481/39932 cut-off events. For 580182/580182 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 544202 event pairs, 311 based on Foata normal form. 0/34993 useless extension candidates. Maximal degree in co-relation 146015. Up to 13058 conditions per place. [2025-03-15 01:26:48,750 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 193 selfloop transitions, 45 changer transitions 37/425 dead transitions. [2025-03-15 01:26:48,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 425 transitions, 9122 flow [2025-03-15 01:26:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 01:26:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 01:26:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2248 transitions. [2025-03-15 01:26:48,752 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7232947232947233 [2025-03-15 01:26:48,753 INFO L298 CegarLoopForPetriNet]: 212 programPoint places, 108 predicate places. [2025-03-15 01:26:48,753 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 425 transitions, 9122 flow [2025-03-15 01:26:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 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,753 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:48,753 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 01:26:48,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:48,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1358414671, now seen corresponding path program 1 times [2025-03-15 01:26:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884060970] [2025-03-15 01:26:48,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:26:48,769 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:26:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:26:48,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:26:48,781 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:26:48,781 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:26:48,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:26:48,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 01:26:48,782 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:48,782 WARN L336 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:26:48,782 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-15 01:26:48,805 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-03-15 01:26:48,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:26:48,807 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;@3e86739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:26:48,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:26:48,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:26:48,810 INFO L124 PetriNetUnfolderBase]: 4/92 cut-off events. [2025-03-15 01:26:48,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:26:48,810 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:48,810 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:48,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash -17116865, now seen corresponding path program 1 times [2025-03-15 01:26:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35628398] [2025-03-15 01:26:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:48,837 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:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:48,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35628398] [2025-03-15 01:26:48,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35628398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:48,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526764673] [2025-03-15 01:26:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:48,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:48,838 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 244 [2025-03-15 01:26:48,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 244 transitions, 628 flow. Second operand has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:48,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 244 [2025-03-15 01:26:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:58,911 INFO L124 PetriNetUnfolderBase]: 14533/87157 cut-off events. [2025-03-15 01:26:58,911 INFO L125 PetriNetUnfolderBase]: For 15730/15730 co-relation queries the response was YES. [2025-03-15 01:26:59,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137480 conditions, 87157 events. 14533/87157 cut-off events. For 15730/15730 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 1262517 event pairs, 2560 based on Foata normal form. 53331/127592 useless extension candidates. Maximal degree in co-relation 67581. Up to 23854 conditions per place. [2025-03-15 01:26:59,801 INFO L140 encePairwiseOnDemand]: 220/244 looper letters, 95 selfloop transitions, 10 changer transitions 34/275 dead transitions. [2025-03-15 01:26:59,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 275 transitions, 968 flow [2025-03-15 01:26:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 961 transitions. [2025-03-15 01:26:59,803 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7877049180327869 [2025-03-15 01:26:59,803 INFO L298 CegarLoopForPetriNet]: 233 programPoint places, -1 predicate places. [2025-03-15 01:26:59,803 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 275 transitions, 968 flow [2025-03-15 01:26:59,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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:59,803 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:59,803 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:59,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 01:26:59,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -552034943, now seen corresponding path program 1 times [2025-03-15 01:26:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574882672] [2025-03-15 01:26:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:59,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574882672] [2025-03-15 01:26:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574882672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:59,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909263522] [2025-03-15 01:26:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:59,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:59,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:59,833 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 244 [2025-03-15 01:26:59,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 275 transitions, 968 flow. Second operand has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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:59,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:59,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 244 [2025-03-15 01:26:59,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:21,437 INFO L124 PetriNetUnfolderBase]: 28914/172946 cut-off events. [2025-03-15 01:27:21,437 INFO L125 PetriNetUnfolderBase]: For 52423/52423 co-relation queries the response was YES. [2025-03-15 01:27:22,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341878 conditions, 172946 events. 28914/172946 cut-off events. For 52423/52423 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 2796300 event pairs, 3856 based on Foata normal form. 0/147425 useless extension candidates. Maximal degree in co-relation 166841. Up to 47436 conditions per place. [2025-03-15 01:27:23,481 INFO L140 encePairwiseOnDemand]: 231/244 looper letters, 184 selfloop transitions, 10 changer transitions 39/373 dead transitions. [2025-03-15 01:27:23,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 373 transitions, 1952 flow [2025-03-15 01:27:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:27:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:27:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 826 transitions. [2025-03-15 01:27:23,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8463114754098361 [2025-03-15 01:27:23,482 INFO L298 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2025-03-15 01:27:23,483 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 373 transitions, 1952 flow [2025-03-15 01:27:23,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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:23,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:23,483 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:23,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 01:27:23,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:27:23,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -825906875, now seen corresponding path program 1 times [2025-03-15 01:27:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207215214] [2025-03-15 01:27:23,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:23,513 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:27:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207215214] [2025-03-15 01:27:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207215214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312054939] [2025-03-15 01:27:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:23,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:23,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:23,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:23,514 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 244 [2025-03-15 01:27:23,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 373 transitions, 1952 flow. Second operand has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 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:23,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:23,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 244 [2025-03-15 01:27:23,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:46,598 INFO L124 PetriNetUnfolderBase]: 28914/172924 cut-off events. [2025-03-15 01:27:46,598 INFO L125 PetriNetUnfolderBase]: For 94439/94439 co-relation queries the response was YES. [2025-03-15 01:27:48,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410950 conditions, 172924 events. 28914/172924 cut-off events. For 94439/94439 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 2796057 event pairs, 3856 based on Foata normal form. 0/147425 useless extension candidates. Maximal degree in co-relation 200236. Up to 47616 conditions per place. [2025-03-15 01:27:48,623 INFO L140 encePairwiseOnDemand]: 231/244 looper letters, 177 selfloop transitions, 19 changer transitions 39/376 dead transitions. [2025-03-15 01:27:48,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 376 transitions, 2366 flow [2025-03-15 01:27:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 941 transitions. [2025-03-15 01:27:48,625 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.771311475409836 [2025-03-15 01:27:48,625 INFO L298 CegarLoopForPetriNet]: 233 programPoint places, 6 predicate places. [2025-03-15 01:27:48,625 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 376 transitions, 2366 flow [2025-03-15 01:27:48,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 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:48,625 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:48,625 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:48,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 01:27:48,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:27:48,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 398082058, now seen corresponding path program 1 times [2025-03-15 01:27:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141570611] [2025-03-15 01:27:48,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:48,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:27:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:48,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141570611] [2025-03-15 01:27:48,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141570611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:48,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:48,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:27:48,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407787645] [2025-03-15 01:27:48,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:48,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:27:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:48,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:27:48,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:27:48,662 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 244 [2025-03-15 01:27:48,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 376 transitions, 2366 flow. Second operand has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 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:48,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:48,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 244 [2025-03-15 01:27:48,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand