./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:47:57,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:47:57,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:47:57,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:47:57,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:47:57,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:47:57,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:47:57,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:47:57,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:47:57,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:47:57,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:47:57,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:47:57,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:47:57,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:47:57,785 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:47:57,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:47:57,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:47:57,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:47:57,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:47:57,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:47:57,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2025-03-09 02:47:58,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:47:58,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:47:58,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:47:58,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:47:58,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:47:58,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-03-09 02:47:59,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a3313b4/50634ad4dc984f84bba038436860f244/FLAG672a45db0 [2025-03-09 02:47:59,461 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:47:59,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-03-09 02:47:59,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a3313b4/50634ad4dc984f84bba038436860f244/FLAG672a45db0 [2025-03-09 02:47:59,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a3313b4/50634ad4dc984f84bba038436860f244 [2025-03-09 02:47:59,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:47:59,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:47:59,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:47:59,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:47:59,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:47:59,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b657fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59, skipping insertion in model container [2025-03-09 02:47:59,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:47:59,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:47:59,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:47:59,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:47:59,906 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:47:59,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59 WrapperNode [2025-03-09 02:47:59,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:47:59,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:47:59,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:47:59,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:47:59,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,933 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 232 [2025-03-09 02:47:59,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:47:59,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:47:59,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:47:59,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:47:59,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,951 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:47:59,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:47:59,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:47:59,959 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:47:59,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:47:59,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (1/1) ... [2025-03-09 02:47:59,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:47:59,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:59,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:47:59,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:48:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:00,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:00,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:00,369 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:00,369 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:00,378 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:00,379 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:00,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:00 BoogieIcfgContainer [2025-03-09 02:48:00,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:00,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:00,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:00,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:00,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:47:59" (1/3) ... [2025-03-09 02:48:00,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf6389a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:00, skipping insertion in model container [2025-03-09 02:48:00,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:59" (2/3) ... [2025-03-09 02:48:00,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf6389a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:00, skipping insertion in model container [2025-03-09 02:48:00,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:00" (3/3) ... [2025-03-09 02:48:00,388 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-03-09 02:48:00,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:00,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 83 locations, 1 initial locations, 1 loop locations, and 14 error locations. [2025-03-09 02:48:00,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:00,446 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6978e689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:00,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 02:48:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 82 states have internal predecessors, (118), 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-09 02:48:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:48:00,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:00,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:00,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1269658140, now seen corresponding path program 1 times [2025-03-09 02:48:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188813956] [2025-03-09 02:48:00,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:00,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:48:00,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:48:00,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:00,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:00,599 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-09 02:48:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188813956] [2025-03-09 02:48:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188813956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:00,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:00,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593526024] [2025-03-09 02:48:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:00,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:48:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:48:00,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:48:00,620 INFO L87 Difference]: Start difference. First operand has 83 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 82 states have internal predecessors, (118), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-09 02:48:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:00,636 INFO L93 Difference]: Finished difference Result 139 states and 195 transitions. [2025-03-09 02:48:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:48:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2025-03-09 02:48:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:00,645 INFO L225 Difference]: With dead ends: 139 [2025-03-09 02:48:00,645 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:48:00,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:48:00,651 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:00,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:48:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 02:48:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.703125) internal successors, (109), 75 states have internal predecessors, (109), 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-09 02:48:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2025-03-09 02:48:00,686 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 10 [2025-03-09 02:48:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2025-03-09 02:48:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-09 02:48:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2025-03-09 02:48:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:48:00,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:00,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:00,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:48:00,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1600484783, now seen corresponding path program 1 times [2025-03-09 02:48:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316900272] [2025-03-09 02:48:00,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:00,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:48:00,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:48:00,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:00,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:00,909 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-09 02:48:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316900272] [2025-03-09 02:48:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316900272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:48:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908744898] [2025-03-09 02:48:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:00,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:00,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:00,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:00,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:00,914 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-09 02:48:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:00,961 INFO L93 Difference]: Finished difference Result 134 states and 184 transitions. [2025-03-09 02:48:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:00,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2025-03-09 02:48:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:00,964 INFO L225 Difference]: With dead ends: 134 [2025-03-09 02:48:00,964 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:48:00,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:00,964 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:00,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:48:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 02:48:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.453125) internal successors, (93), 75 states have internal predecessors, (93), 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-09 02:48:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2025-03-09 02:48:00,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 15 [2025-03-09 02:48:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:00,969 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2025-03-09 02:48:00,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-09 02:48:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2025-03-09 02:48:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:48:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:00,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:48:00,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:00,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:00,972 INFO L85 PathProgramCache]: Analyzing trace with hash -716220954, now seen corresponding path program 1 times [2025-03-09 02:48:00,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:00,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336477705] [2025-03-09 02:48:00,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:48:00,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:48:00,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:00,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:01,065 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-09 02:48:01,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336477705] [2025-03-09 02:48:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336477705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:01,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776645934] [2025-03-09 02:48:01,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:01,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:01,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:01,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:01,066 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-09 02:48:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:01,179 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2025-03-09 02:48:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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) Word has length 30 [2025-03-09 02:48:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:01,181 INFO L225 Difference]: With dead ends: 127 [2025-03-09 02:48:01,181 INFO L226 Difference]: Without dead ends: 124 [2025-03-09 02:48:01,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:01,182 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 210 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:01,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 109 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-09 02:48:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2025-03-09 02:48:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.5188679245283019) internal successors, (161), 117 states have internal predecessors, (161), 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-09 02:48:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2025-03-09 02:48:01,193 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 30 [2025-03-09 02:48:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:01,193 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2025-03-09 02:48:01,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-09 02:48:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2025-03-09 02:48:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:48:01,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:01,194 INFO L218 NwaCegarLoop]: 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] [2025-03-09 02:48:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:48:01,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -728013082, now seen corresponding path program 1 times [2025-03-09 02:48:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021227586] [2025-03-09 02:48:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:01,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:48:01,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:48:01,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:01,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:01,290 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-09 02:48:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021227586] [2025-03-09 02:48:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021227586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291153726] [2025-03-09 02:48:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:01,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:01,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:01,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:01,291 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-09 02:48:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:01,395 INFO L93 Difference]: Finished difference Result 220 states and 297 transitions. [2025-03-09 02:48:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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) Word has length 31 [2025-03-09 02:48:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:01,399 INFO L225 Difference]: With dead ends: 220 [2025-03-09 02:48:01,399 INFO L226 Difference]: Without dead ends: 217 [2025-03-09 02:48:01,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:01,401 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 200 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:01,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 161 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-09 02:48:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 160. [2025-03-09 02:48:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.527027027027027) internal successors, (226), 159 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2025-03-09 02:48:01,408 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 31 [2025-03-09 02:48:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2025-03-09 02:48:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-09 02:48:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2025-03-09 02:48:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:48:01,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:01,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:01,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:48:01,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:01,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1093569052, now seen corresponding path program 1 times [2025-03-09 02:48:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642942850] [2025-03-09 02:48:01,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:01,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:48:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:48:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:01,521 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-09 02:48:01,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642942850] [2025-03-09 02:48:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642942850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260366633] [2025-03-09 02:48:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:01,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:01,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:01,523 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-09 02:48:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:01,683 INFO L93 Difference]: Finished difference Result 259 states and 365 transitions. [2025-03-09 02:48:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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) Word has length 32 [2025-03-09 02:48:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:01,685 INFO L225 Difference]: With dead ends: 259 [2025-03-09 02:48:01,685 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 02:48:01,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:01,686 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 455 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:01,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 189 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 02:48:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2025-03-09 02:48:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 232 states have (on average 1.5344827586206897) internal successors, (356), 243 states have internal predecessors, (356), 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-09 02:48:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 356 transitions. [2025-03-09 02:48:01,700 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 356 transitions. Word has length 32 [2025-03-09 02:48:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 356 transitions. [2025-03-09 02:48:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-09 02:48:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 356 transitions. [2025-03-09 02:48:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:48:01,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:01,702 INFO L218 NwaCegarLoop]: 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-09 02:48:01,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:48:01,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:01,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash 459097764, now seen corresponding path program 1 times [2025-03-09 02:48:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:01,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387495550] [2025-03-09 02:48:01,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:01,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:48:01,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:48:01,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:01,772 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-09 02:48:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387495550] [2025-03-09 02:48:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387495550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553255748] [2025-03-09 02:48:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:01,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:01,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:01,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:01,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:01,773 INFO L87 Difference]: Start difference. First operand 244 states and 356 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-09 02:48:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:01,969 INFO L93 Difference]: Finished difference Result 739 states and 1083 transitions. [2025-03-09 02:48:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:48:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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) Word has length 33 [2025-03-09 02:48:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:01,971 INFO L225 Difference]: With dead ends: 739 [2025-03-09 02:48:01,971 INFO L226 Difference]: Without dead ends: 517 [2025-03-09 02:48:01,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:01,972 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 402 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:01,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 332 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-09 02:48:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 370. [2025-03-09 02:48:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 358 states have (on average 1.4972067039106145) internal successors, (536), 369 states have internal predecessors, (536), 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-09 02:48:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 536 transitions. [2025-03-09 02:48:01,984 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 536 transitions. Word has length 33 [2025-03-09 02:48:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:01,985 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 536 transitions. [2025-03-09 02:48:01,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-09 02:48:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 536 transitions. [2025-03-09 02:48:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:48:01,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:01,985 INFO L218 NwaCegarLoop]: 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-09 02:48:01,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:48:01,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:01,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -573247478, now seen corresponding path program 1 times [2025-03-09 02:48:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-09 02:48:01,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:48:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:48:01,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:01,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,026 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-09 02:48:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-09 02:48:02,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123554465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909702030] [2025-03-09 02:48:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:02,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,029 INFO L87 Difference]: Start difference. First operand 370 states and 536 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-09 02:48:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:02,053 INFO L93 Difference]: Finished difference Result 1034 states and 1508 transitions. [2025-03-09 02:48:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2025-03-09 02:48:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:02,056 INFO L225 Difference]: With dead ends: 1034 [2025-03-09 02:48:02,056 INFO L226 Difference]: Without dead ends: 686 [2025-03-09 02:48:02,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,057 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:02,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 217 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-09 02:48:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 674. [2025-03-09 02:48:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 662 states have (on average 1.4894259818731117) internal successors, (986), 673 states have internal predecessors, (986), 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-09 02:48:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 986 transitions. [2025-03-09 02:48:02,077 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 986 transitions. Word has length 35 [2025-03-09 02:48:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:02,077 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 986 transitions. [2025-03-09 02:48:02,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-09 02:48:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 986 transitions. [2025-03-09 02:48:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:48:02,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:02,078 INFO L218 NwaCegarLoop]: 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] [2025-03-09 02:48:02,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:48:02,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 869366498, now seen corresponding path program 1 times [2025-03-09 02:48:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140523674] [2025-03-09 02:48:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:02,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:48:02,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:48:02,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,115 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-09 02:48:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140523674] [2025-03-09 02:48:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140523674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421789814] [2025-03-09 02:48:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:02,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,117 INFO L87 Difference]: Start difference. First operand 674 states and 986 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-09 02:48:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:02,138 INFO L93 Difference]: Finished difference Result 1882 states and 2770 transitions. [2025-03-09 02:48:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) Word has length 36 [2025-03-09 02:48:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:02,142 INFO L225 Difference]: With dead ends: 1882 [2025-03-09 02:48:02,143 INFO L226 Difference]: Without dead ends: 1230 [2025-03-09 02:48:02,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,144 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:02,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-03-09 02:48:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1218. [2025-03-09 02:48:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1206 states have (on average 1.48424543946932) internal successors, (1790), 1217 states have internal predecessors, (1790), 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-09 02:48:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1790 transitions. [2025-03-09 02:48:02,170 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1790 transitions. Word has length 36 [2025-03-09 02:48:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:02,170 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1790 transitions. [2025-03-09 02:48:02,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-09 02:48:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1790 transitions. [2025-03-09 02:48:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:48:02,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:02,171 INFO L218 NwaCegarLoop]: 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] [2025-03-09 02:48:02,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:48:02,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:02,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 373307912, now seen corresponding path program 1 times [2025-03-09 02:48:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127358590] [2025-03-09 02:48:02,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:02,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:48:02,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:48:02,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:02,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,216 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-09 02:48:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127358590] [2025-03-09 02:48:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127358590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664175852] [2025-03-09 02:48:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:02,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,218 INFO L87 Difference]: Start difference. First operand 1218 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-09 02:48:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:02,251 INFO L93 Difference]: Finished difference Result 3482 states and 5102 transitions. [2025-03-09 02:48:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) Word has length 37 [2025-03-09 02:48:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:02,258 INFO L225 Difference]: With dead ends: 3482 [2025-03-09 02:48:02,258 INFO L226 Difference]: Without dead ends: 2286 [2025-03-09 02:48:02,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,260 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:02,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-03-09 02:48:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2274. [2025-03-09 02:48:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2262 states have (on average 1.4597701149425288) internal successors, (3302), 2273 states have internal predecessors, (3302), 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-09 02:48:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3302 transitions. [2025-03-09 02:48:02,334 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3302 transitions. Word has length 37 [2025-03-09 02:48:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:02,334 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 3302 transitions. [2025-03-09 02:48:02,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-09 02:48:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3302 transitions. [2025-03-09 02:48:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:48:02,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:02,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:48:02,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:02,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash -491432785, now seen corresponding path program 1 times [2025-03-09 02:48:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121744216] [2025-03-09 02:48:02,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:02,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:48:02,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:48:02,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:02,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:02,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121744216] [2025-03-09 02:48:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121744216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202788762] [2025-03-09 02:48:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:02,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,392 INFO L87 Difference]: Start difference. First operand 2274 states and 3302 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-09 02:48:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:02,437 INFO L93 Difference]: Finished difference Result 5102 states and 7368 transitions. [2025-03-09 02:48:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) Word has length 53 [2025-03-09 02:48:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:02,446 INFO L225 Difference]: With dead ends: 5102 [2025-03-09 02:48:02,446 INFO L226 Difference]: Without dead ends: 2850 [2025-03-09 02:48:02,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:02,449 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:02,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 156 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2025-03-09 02:48:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2804. [2025-03-09 02:48:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2792 states have (on average 1.4398280802292263) internal successors, (4020), 2803 states have internal predecessors, (4020), 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-09 02:48:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 4020 transitions. [2025-03-09 02:48:02,528 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 4020 transitions. Word has length 53 [2025-03-09 02:48:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 2804 states and 4020 transitions. [2025-03-09 02:48:02,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-09 02:48:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 4020 transitions. [2025-03-09 02:48:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:48:02,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:02,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:02,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:48:02,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:02,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 871874656, now seen corresponding path program 1 times [2025-03-09 02:48:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735905508] [2025-03-09 02:48:02,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:48:02,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:48:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:02,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735905508] [2025-03-09 02:48:02,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735905508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:48:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189421260] [2025-03-09 02:48:02,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:02,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:02,659 INFO L87 Difference]: Start difference. First operand 2804 states and 4020 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-09 02:48:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:02,813 INFO L93 Difference]: Finished difference Result 5590 states and 8016 transitions. [2025-03-09 02:48:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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) Word has length 57 [2025-03-09 02:48:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:02,822 INFO L225 Difference]: With dead ends: 5590 [2025-03-09 02:48:02,822 INFO L226 Difference]: Without dead ends: 2810 [2025-03-09 02:48:02,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:48:02,828 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 130 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:02,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 162 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2025-03-09 02:48:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2804. [2025-03-09 02:48:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2792 states have (on average 1.4283667621776504) internal successors, (3988), 2803 states have internal predecessors, (3988), 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-09 02:48:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3988 transitions. [2025-03-09 02:48:02,896 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3988 transitions. Word has length 57 [2025-03-09 02:48:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:02,896 INFO L471 AbstractCegarLoop]: Abstraction has 2804 states and 3988 transitions. [2025-03-09 02:48:02,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-09 02:48:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3988 transitions. [2025-03-09 02:48:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:48:02,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:02,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:02,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:48:02,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:02,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash 462031083, now seen corresponding path program 1 times [2025-03-09 02:48:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:02,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634134977] [2025-03-09 02:48:02,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:02,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:48:02,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:48:02,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:02,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634134977] [2025-03-09 02:48:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634134977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446253103] [2025-03-09 02:48:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:02,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:02,998 INFO L87 Difference]: Start difference. First operand 2804 states and 3988 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-09 02:48:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:03,121 INFO L93 Difference]: Finished difference Result 3656 states and 5212 transitions. [2025-03-09 02:48:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:03,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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) Word has length 58 [2025-03-09 02:48:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:03,131 INFO L225 Difference]: With dead ends: 3656 [2025-03-09 02:48:03,131 INFO L226 Difference]: Without dead ends: 3653 [2025-03-09 02:48:03,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:03,133 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 101 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:03,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 210 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2025-03-09 02:48:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 2872. [2025-03-09 02:48:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2860 states have (on average 1.4377622377622377) internal successors, (4112), 2871 states have internal predecessors, (4112), 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-09 02:48:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4112 transitions. [2025-03-09 02:48:03,232 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4112 transitions. Word has length 58 [2025-03-09 02:48:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:03,232 INFO L471 AbstractCegarLoop]: Abstraction has 2872 states and 4112 transitions. [2025-03-09 02:48:03,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-09 02:48:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4112 transitions. [2025-03-09 02:48:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:48:03,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:03,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:48:03,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:03,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1438061695, now seen corresponding path program 1 times [2025-03-09 02:48:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:03,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-09 02:48:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:48:03,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:48:03,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:03,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-09 02:48:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948944698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:03,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567623275] [2025-03-09 02:48:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:03,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:03,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:03,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:03,317 INFO L87 Difference]: Start difference. First operand 2872 states and 4112 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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-09 02:48:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:03,489 INFO L93 Difference]: Finished difference Result 8082 states and 11668 transitions. [2025-03-09 02:48:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:03,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 59 [2025-03-09 02:48:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:03,503 INFO L225 Difference]: With dead ends: 8082 [2025-03-09 02:48:03,503 INFO L226 Difference]: Without dead ends: 5234 [2025-03-09 02:48:03,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:03,509 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 246 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:03,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 201 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2025-03-09 02:48:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 4552. [2025-03-09 02:48:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4552 states, 4540 states have (on average 1.4440528634361234) internal successors, (6556), 4551 states have internal predecessors, (6556), 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-09 02:48:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6556 transitions. [2025-03-09 02:48:03,636 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6556 transitions. Word has length 59 [2025-03-09 02:48:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:03,636 INFO L471 AbstractCegarLoop]: Abstraction has 4552 states and 6556 transitions. [2025-03-09 02:48:03,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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-09 02:48:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6556 transitions. [2025-03-09 02:48:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:48:03,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:03,637 INFO L218 NwaCegarLoop]: 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] [2025-03-09 02:48:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:48:03,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1396736479, now seen corresponding path program 1 times [2025-03-09 02:48:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071377468] [2025-03-09 02:48:03,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:03,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:48:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:48:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:03,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071377468] [2025-03-09 02:48:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071377468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:03,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631968814] [2025-03-09 02:48:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:03,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:03,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:03,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:03,707 INFO L87 Difference]: Start difference. First operand 4552 states and 6556 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-09 02:48:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:03,798 INFO L93 Difference]: Finished difference Result 4555 states and 6556 transitions. [2025-03-09 02:48:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:03,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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) Word has length 59 [2025-03-09 02:48:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:03,811 INFO L225 Difference]: With dead ends: 4555 [2025-03-09 02:48:03,812 INFO L226 Difference]: Without dead ends: 4552 [2025-03-09 02:48:03,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:03,814 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:03,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 162 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2025-03-09 02:48:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4549. [2025-03-09 02:48:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4540 states have (on average 1.4123348017621145) internal successors, (6412), 4548 states have internal predecessors, (6412), 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-09 02:48:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6412 transitions. [2025-03-09 02:48:03,926 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6412 transitions. Word has length 59 [2025-03-09 02:48:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:03,926 INFO L471 AbstractCegarLoop]: Abstraction has 4549 states and 6412 transitions. [2025-03-09 02:48:03,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-09 02:48:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6412 transitions. [2025-03-09 02:48:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:48:03,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:03,927 INFO L218 NwaCegarLoop]: 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-09 02:48:03,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:48:03,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1630239593, now seen corresponding path program 1 times [2025-03-09 02:48:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:03,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051212678] [2025-03-09 02:48:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:03,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:48:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:48:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051212678] [2025-03-09 02:48:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051212678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336056483] [2025-03-09 02:48:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:04,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:04,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:04,014 INFO L87 Difference]: Start difference. First operand 4549 states and 6412 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-09 02:48:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:04,175 INFO L93 Difference]: Finished difference Result 9077 states and 12788 transitions. [2025-03-09 02:48:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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) Word has length 60 [2025-03-09 02:48:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:04,198 INFO L225 Difference]: With dead ends: 9077 [2025-03-09 02:48:04,200 INFO L226 Difference]: Without dead ends: 5324 [2025-03-09 02:48:04,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:04,206 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 202 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 279 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2025-03-09 02:48:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 5321. [2025-03-09 02:48:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5312 states have (on average 1.3855421686746987) internal successors, (7360), 5320 states have internal predecessors, (7360), 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-09 02:48:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 7360 transitions. [2025-03-09 02:48:04,351 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 7360 transitions. Word has length 60 [2025-03-09 02:48:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:04,351 INFO L471 AbstractCegarLoop]: Abstraction has 5321 states and 7360 transitions. [2025-03-09 02:48:04,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-09 02:48:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 7360 transitions. [2025-03-09 02:48:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:48:04,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:04,352 INFO L218 NwaCegarLoop]: 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-09 02:48:04,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:48:04,353 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1156407639, now seen corresponding path program 1 times [2025-03-09 02:48:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727902628] [2025-03-09 02:48:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:04,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:48:04,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:48:04,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:04,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:48:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727902628] [2025-03-09 02:48:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727902628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:04,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:04,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146524335] [2025-03-09 02:48:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:04,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:04,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:04,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:04,453 INFO L87 Difference]: Start difference. First operand 5321 states and 7360 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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-09 02:48:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:04,633 INFO L93 Difference]: Finished difference Result 9849 states and 13748 transitions. [2025-03-09 02:48:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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) Word has length 60 [2025-03-09 02:48:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:04,643 INFO L225 Difference]: With dead ends: 9849 [2025-03-09 02:48:04,644 INFO L226 Difference]: Without dead ends: 5324 [2025-03-09 02:48:04,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:04,650 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 208 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:04,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 269 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2025-03-09 02:48:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 5321. [2025-03-09 02:48:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5312 states have (on average 1.3772590361445782) internal successors, (7316), 5320 states have internal predecessors, (7316), 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-09 02:48:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 7316 transitions. [2025-03-09 02:48:04,789 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 7316 transitions. Word has length 60 [2025-03-09 02:48:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:04,790 INFO L471 AbstractCegarLoop]: Abstraction has 5321 states and 7316 transitions. [2025-03-09 02:48:04,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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-09 02:48:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 7316 transitions. [2025-03-09 02:48:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:48:04,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:04,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:04,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:48:04,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:04,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -349157877, now seen corresponding path program 1 times [2025-03-09 02:48:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-03-09 02:48:04,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:04,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:48:04,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:48:04,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:04,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-03-09 02:48:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221803913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652249171] [2025-03-09 02:48:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:04,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:04,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:04,869 INFO L87 Difference]: Start difference. First operand 5321 states and 7316 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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-09 02:48:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:04,983 INFO L93 Difference]: Finished difference Result 7010 states and 9764 transitions. [2025-03-09 02:48:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:04,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 60 [2025-03-09 02:48:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:04,996 INFO L225 Difference]: With dead ends: 7010 [2025-03-09 02:48:04,996 INFO L226 Difference]: Without dead ends: 7007 [2025-03-09 02:48:04,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:04,999 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:05,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 206 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2025-03-09 02:48:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 7001. [2025-03-09 02:48:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7001 states, 6992 states have (on average 1.375858123569794) internal successors, (9620), 7000 states have internal predecessors, (9620), 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-09 02:48:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 9620 transitions. [2025-03-09 02:48:05,130 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 9620 transitions. Word has length 60 [2025-03-09 02:48:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:05,130 INFO L471 AbstractCegarLoop]: Abstraction has 7001 states and 9620 transitions. [2025-03-09 02:48:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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-09 02:48:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 9620 transitions. [2025-03-09 02:48:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 02:48:05,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:05,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:05,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:48:05,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:05,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2061007711, now seen corresponding path program 1 times [2025-03-09 02:48:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:05,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667300282] [2025-03-09 02:48:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 02:48:05,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 02:48:05,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667300282] [2025-03-09 02:48:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667300282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:05,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:05,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444251736] [2025-03-09 02:48:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:05,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:05,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:05,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:05,220 INFO L87 Difference]: Start difference. First operand 7001 states and 9620 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 02:48:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:05,403 INFO L93 Difference]: Finished difference Result 13289 states and 18740 transitions. [2025-03-09 02:48:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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) Word has length 61 [2025-03-09 02:48:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:05,420 INFO L225 Difference]: With dead ends: 13289 [2025-03-09 02:48:05,421 INFO L226 Difference]: Without dead ends: 8240 [2025-03-09 02:48:05,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:05,429 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 230 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:05,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 213 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2025-03-09 02:48:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 6825. [2025-03-09 02:48:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6825 states, 6816 states have (on average 1.3820422535211268) internal successors, (9420), 6824 states have internal predecessors, (9420), 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-09 02:48:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6825 states to 6825 states and 9420 transitions. [2025-03-09 02:48:05,564 INFO L78 Accepts]: Start accepts. Automaton has 6825 states and 9420 transitions. Word has length 61 [2025-03-09 02:48:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:05,564 INFO L471 AbstractCegarLoop]: Abstraction has 6825 states and 9420 transitions. [2025-03-09 02:48:05,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 02:48:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6825 states and 9420 transitions. [2025-03-09 02:48:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 02:48:05,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:05,565 INFO L218 NwaCegarLoop]: 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, 1, 1] [2025-03-09 02:48:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:48:05,565 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -533270391, now seen corresponding path program 1 times [2025-03-09 02:48:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-03-09 02:48:05,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:05,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:48:05,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:48:05,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:05,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:05,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:05,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-03-09 02:48:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024945763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:05,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:05,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974949184] [2025-03-09 02:48:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:05,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:05,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:05,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:05,660 INFO L87 Difference]: Start difference. First operand 6825 states and 9420 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-09 02:48:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:05,832 INFO L93 Difference]: Finished difference Result 11597 states and 16252 transitions. [2025-03-09 02:48:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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) Word has length 62 [2025-03-09 02:48:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:05,845 INFO L225 Difference]: With dead ends: 11597 [2025-03-09 02:48:05,845 INFO L226 Difference]: Without dead ends: 7108 [2025-03-09 02:48:05,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:05,852 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 199 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:05,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 288 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7108 states. [2025-03-09 02:48:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7108 to 7105. [2025-03-09 02:48:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 7096 states have (on average 1.3771138669673055) internal successors, (9772), 7104 states have internal predecessors, (9772), 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-09 02:48:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 9772 transitions. [2025-03-09 02:48:05,974 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 9772 transitions. Word has length 62 [2025-03-09 02:48:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:05,974 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 9772 transitions. [2025-03-09 02:48:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-09 02:48:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 9772 transitions. [2025-03-09 02:48:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:48:05,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:05,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:05,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:48:05,976 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1397980083, now seen corresponding path program 1 times [2025-03-09 02:48:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:05,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-03-09 02:48:05,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:05,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:48:05,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:48:05,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:05,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:06,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-03-09 02:48:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941039316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020738020] [2025-03-09 02:48:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:06,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:06,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:06,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:06,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:06,055 INFO L87 Difference]: Start difference. First operand 7105 states and 9772 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-09 02:48:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:06,247 INFO L93 Difference]: Finished difference Result 7495 states and 10292 transitions. [2025-03-09 02:48:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:06,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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) Word has length 64 [2025-03-09 02:48:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:06,261 INFO L225 Difference]: With dead ends: 7495 [2025-03-09 02:48:06,261 INFO L226 Difference]: Without dead ends: 7492 [2025-03-09 02:48:06,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:06,265 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 164 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:06,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 265 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2025-03-09 02:48:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 7489. [2025-03-09 02:48:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7489 states, 7480 states have (on average 1.367379679144385) internal successors, (10228), 7488 states have internal predecessors, (10228), 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-09 02:48:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 10228 transitions. [2025-03-09 02:48:06,438 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 10228 transitions. Word has length 64 [2025-03-09 02:48:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:06,438 INFO L471 AbstractCegarLoop]: Abstraction has 7489 states and 10228 transitions. [2025-03-09 02:48:06,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-09 02:48:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 10228 transitions. [2025-03-09 02:48:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:48:06,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:06,439 INFO L218 NwaCegarLoop]: 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] [2025-03-09 02:48:06,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:48:06,440 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:06,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash -756304721, now seen corresponding path program 1 times [2025-03-09 02:48:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:06,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812617935] [2025-03-09 02:48:06,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:06,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:06,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:48:06,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:48:06,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:06,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812617935] [2025-03-09 02:48:06,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812617935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:06,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:06,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079222416] [2025-03-09 02:48:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:06,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:06,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:06,507 INFO L87 Difference]: Start difference. First operand 7489 states and 10228 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-09 02:48:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:06,638 INFO L93 Difference]: Finished difference Result 9741 states and 13492 transitions. [2025-03-09 02:48:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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) Word has length 64 [2025-03-09 02:48:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:06,655 INFO L225 Difference]: With dead ends: 9741 [2025-03-09 02:48:06,655 INFO L226 Difference]: Without dead ends: 9738 [2025-03-09 02:48:06,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:06,660 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:06,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 251 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9738 states. [2025-03-09 02:48:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9738 to 9169. [2025-03-09 02:48:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9169 states, 9160 states have (on average 1.3524017467248908) internal successors, (12388), 9168 states have internal predecessors, (12388), 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-09 02:48:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9169 states to 9169 states and 12388 transitions. [2025-03-09 02:48:06,811 INFO L78 Accepts]: Start accepts. Automaton has 9169 states and 12388 transitions. Word has length 64 [2025-03-09 02:48:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:06,811 INFO L471 AbstractCegarLoop]: Abstraction has 9169 states and 12388 transitions. [2025-03-09 02:48:06,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-09 02:48:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 9169 states and 12388 transitions. [2025-03-09 02:48:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:48:06,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:06,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:06,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:48:06,812 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:06,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:06,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1970609861, now seen corresponding path program 1 times [2025-03-09 02:48:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-09 02:48:06,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:06,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:48:06,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:48:06,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:06,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-09 02:48:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484234762] [2025-03-09 02:48:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:06,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:06,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:06,887 INFO L87 Difference]: Start difference. First operand 9169 states and 12388 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-09 02:48:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:07,017 INFO L93 Difference]: Finished difference Result 11159 states and 15084 transitions. [2025-03-09 02:48:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) Word has length 65 [2025-03-09 02:48:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:07,029 INFO L225 Difference]: With dead ends: 11159 [2025-03-09 02:48:07,029 INFO L226 Difference]: Without dead ends: 7233 [2025-03-09 02:48:07,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:07,035 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 137 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 281 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7233 states. [2025-03-09 02:48:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7233 to 5433. [2025-03-09 02:48:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5433 states, 5424 states have (on average 1.3384955752212389) internal successors, (7260), 5432 states have internal predecessors, (7260), 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-09 02:48:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 7260 transitions. [2025-03-09 02:48:07,113 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 7260 transitions. Word has length 65 [2025-03-09 02:48:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 5433 states and 7260 transitions. [2025-03-09 02:48:07,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-09 02:48:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 7260 transitions. [2025-03-09 02:48:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:48:07,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:07,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:07,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:48:07,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:07,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:07,115 INFO L85 PathProgramCache]: Analyzing trace with hash -959363539, now seen corresponding path program 1 times [2025-03-09 02:48:07,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:07,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010568247] [2025-03-09 02:48:07,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:07,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:48:07,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:48:07,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:07,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010568247] [2025-03-09 02:48:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010568247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620845979] [2025-03-09 02:48:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:07,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:07,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:07,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:07,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:07,212 INFO L87 Difference]: Start difference. First operand 5433 states and 7260 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-09 02:48:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:07,338 INFO L93 Difference]: Finished difference Result 6467 states and 8724 transitions. [2025-03-09 02:48:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) Word has length 66 [2025-03-09 02:48:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:07,348 INFO L225 Difference]: With dead ends: 6467 [2025-03-09 02:48:07,349 INFO L226 Difference]: Without dead ends: 6466 [2025-03-09 02:48:07,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:07,351 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 132 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:07,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 337 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6466 states. [2025-03-09 02:48:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6466 to 6457. [2025-03-09 02:48:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6457 states, 6448 states have (on average 1.3517369727047146) internal successors, (8716), 6456 states have internal predecessors, (8716), 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-09 02:48:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6457 states to 6457 states and 8716 transitions. [2025-03-09 02:48:07,444 INFO L78 Accepts]: Start accepts. Automaton has 6457 states and 8716 transitions. Word has length 66 [2025-03-09 02:48:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:07,445 INFO L471 AbstractCegarLoop]: Abstraction has 6457 states and 8716 transitions. [2025-03-09 02:48:07,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-09 02:48:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 8716 transitions. [2025-03-09 02:48:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:48:07,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:07,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:07,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:48:07,447 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:07,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 548956525, now seen corresponding path program 1 times [2025-03-09 02:48:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889326996] [2025-03-09 02:48:07,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:07,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:48:07,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:48:07,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:07,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:07,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889326996] [2025-03-09 02:48:07,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889326996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:07,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331163078] [2025-03-09 02:48:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:07,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:07,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:07,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:07,532 INFO L87 Difference]: Start difference. First operand 6457 states and 8716 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-09 02:48:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:07,674 INFO L93 Difference]: Finished difference Result 6743 states and 9100 transitions. [2025-03-09 02:48:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:07,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) Word has length 66 [2025-03-09 02:48:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:07,685 INFO L225 Difference]: With dead ends: 6743 [2025-03-09 02:48:07,685 INFO L226 Difference]: Without dead ends: 6740 [2025-03-09 02:48:07,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:07,688 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 138 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:07,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 288 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2025-03-09 02:48:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6737. [2025-03-09 02:48:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6737 states, 6728 states have (on average 1.348989298454221) internal successors, (9076), 6736 states have internal predecessors, (9076), 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-09 02:48:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 9076 transitions. [2025-03-09 02:48:07,808 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 9076 transitions. Word has length 66 [2025-03-09 02:48:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 6737 states and 9076 transitions. [2025-03-09 02:48:07,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-09 02:48:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 9076 transitions. [2025-03-09 02:48:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 02:48:07,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:07,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:07,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:48:07,809 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -517518063, now seen corresponding path program 1 times [2025-03-09 02:48:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-03-09 02:48:07,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:48:07,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:48:07,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:07,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-03-09 02:48:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003128665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:07,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:07,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:07,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751560620] [2025-03-09 02:48:07,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:07,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:07,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:07,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:07,877 INFO L87 Difference]: Start difference. First operand 6737 states and 9076 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-09 02:48:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:08,000 INFO L93 Difference]: Finished difference Result 6926 states and 9316 transitions. [2025-03-09 02:48:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:08,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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) Word has length 70 [2025-03-09 02:48:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:08,011 INFO L225 Difference]: With dead ends: 6926 [2025-03-09 02:48:08,011 INFO L226 Difference]: Without dead ends: 6557 [2025-03-09 02:48:08,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:08,014 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 130 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:08,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 375 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2025-03-09 02:48:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 6553. [2025-03-09 02:48:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 6544 states have (on average 1.3484107579462103) internal successors, (8824), 6552 states have internal predecessors, (8824), 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-09 02:48:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8824 transitions. [2025-03-09 02:48:08,103 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8824 transitions. Word has length 70 [2025-03-09 02:48:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:08,103 INFO L471 AbstractCegarLoop]: Abstraction has 6553 states and 8824 transitions. [2025-03-09 02:48:08,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-09 02:48:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8824 transitions. [2025-03-09 02:48:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 02:48:08,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:08,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:48:08,106 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash 332480899, now seen corresponding path program 1 times [2025-03-09 02:48:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-03-09 02:48:08,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 02:48:08,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 02:48:08,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:08,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-03-09 02:48:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434297073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123371132] [2025-03-09 02:48:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:08,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:08,211 INFO L87 Difference]: Start difference. First operand 6553 states and 8824 transitions. Second operand has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 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-09 02:48:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:08,372 INFO L93 Difference]: Finished difference Result 6743 states and 9060 transitions. [2025-03-09 02:48:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 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) Word has length 84 [2025-03-09 02:48:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:08,386 INFO L225 Difference]: With dead ends: 6743 [2025-03-09 02:48:08,386 INFO L226 Difference]: Without dead ends: 6740 [2025-03-09 02:48:08,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:08,389 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 92 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:08,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 316 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2025-03-09 02:48:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6550. [2025-03-09 02:48:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6550 states, 6544 states have (on average 1.3117359413202934) internal successors, (8584), 6549 states have internal predecessors, (8584), 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-09 02:48:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 8584 transitions. [2025-03-09 02:48:08,531 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 8584 transitions. Word has length 84 [2025-03-09 02:48:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:08,531 INFO L471 AbstractCegarLoop]: Abstraction has 6550 states and 8584 transitions. [2025-03-09 02:48:08,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 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-09 02:48:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 8584 transitions. [2025-03-09 02:48:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:48:08,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:08,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:08,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 02:48:08,535 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1686564353, now seen corresponding path program 1 times [2025-03-09 02:48:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063920807] [2025-03-09 02:48:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:08,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:48:08,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:48:08,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:08,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063920807] [2025-03-09 02:48:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063920807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:08,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460115770] [2025-03-09 02:48:08,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:08,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:08,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:08,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:08,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:08,652 INFO L87 Difference]: Start difference. First operand 6550 states and 8584 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-09 02:48:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:08,831 INFO L93 Difference]: Finished difference Result 9437 states and 12468 transitions. [2025-03-09 02:48:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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) Word has length 86 [2025-03-09 02:48:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:08,841 INFO L225 Difference]: With dead ends: 9437 [2025-03-09 02:48:08,841 INFO L226 Difference]: Without dead ends: 5695 [2025-03-09 02:48:08,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:08,846 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 146 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:08,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 309 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2025-03-09 02:48:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5686. [2025-03-09 02:48:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5680 states have (on average 1.3084507042253521) internal successors, (7432), 5685 states have internal predecessors, (7432), 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-09 02:48:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 7432 transitions. [2025-03-09 02:48:08,922 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 7432 transitions. Word has length 86 [2025-03-09 02:48:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:08,922 INFO L471 AbstractCegarLoop]: Abstraction has 5686 states and 7432 transitions. [2025-03-09 02:48:08,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-09 02:48:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 7432 transitions. [2025-03-09 02:48:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:48:08,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:08,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:08,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 02:48:08,925 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash -925510301, now seen corresponding path program 1 times [2025-03-09 02:48:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087144822] [2025-03-09 02:48:08,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:08,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:48:08,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:48:08,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:08,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:48:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087144822] [2025-03-09 02:48:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087144822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111113882] [2025-03-09 02:48:09,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:09,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:09,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:09,015 INFO L87 Difference]: Start difference. First operand 5686 states and 7432 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-09 02:48:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:09,155 INFO L93 Difference]: Finished difference Result 5689 states and 7432 transitions. [2025-03-09 02:48:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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) Word has length 86 [2025-03-09 02:48:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:09,165 INFO L225 Difference]: With dead ends: 5689 [2025-03-09 02:48:09,165 INFO L226 Difference]: Without dead ends: 5686 [2025-03-09 02:48:09,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:09,166 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:09,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 287 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2025-03-09 02:48:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 5686. [2025-03-09 02:48:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5680 states have (on average 1.3028169014084507) internal successors, (7400), 5685 states have internal predecessors, (7400), 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-09 02:48:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 7400 transitions. [2025-03-09 02:48:09,239 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 7400 transitions. Word has length 86 [2025-03-09 02:48:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:09,239 INFO L471 AbstractCegarLoop]: Abstraction has 5686 states and 7400 transitions. [2025-03-09 02:48:09,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-09 02:48:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 7400 transitions. [2025-03-09 02:48:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:48:09,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:09,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:09,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 02:48:09,242 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:09,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash -250442751, now seen corresponding path program 2 times [2025-03-09 02:48:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:09,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247875124] [2025-03-09 02:48:09,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:09,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 02:48:09,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:48:09,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:48:09,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247875124] [2025-03-09 02:48:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247875124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792030733] [2025-03-09 02:48:09,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:09,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:09,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:48:09,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 02:48:09,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:48:09,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:48:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:48:09,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:48:09,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792030733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 02:48:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149345467] [2025-03-09 02:48:09,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:09,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:09,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:09,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:09,541 INFO L87 Difference]: Start difference. First operand 5686 states and 7400 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-09 02:48:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:09,631 INFO L93 Difference]: Finished difference Result 5689 states and 7400 transitions. [2025-03-09 02:48:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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) Word has length 86 [2025-03-09 02:48:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:09,639 INFO L225 Difference]: With dead ends: 5689 [2025-03-09 02:48:09,639 INFO L226 Difference]: Without dead ends: 4758 [2025-03-09 02:48:09,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:09,642 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:09,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 170 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2025-03-09 02:48:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 3918. [2025-03-09 02:48:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3912 states have (on average 1.2658486707566463) internal successors, (4952), 3917 states have internal predecessors, (4952), 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-09 02:48:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 4952 transitions. [2025-03-09 02:48:09,692 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 4952 transitions. Word has length 86 [2025-03-09 02:48:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:09,692 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 4952 transitions. [2025-03-09 02:48:09,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-09 02:48:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 4952 transitions. [2025-03-09 02:48:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 02:48:09,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:09,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:09,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:09,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 02:48:09,895 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:09,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1837331483, now seen corresponding path program 1 times [2025-03-09 02:48:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145555582] [2025-03-09 02:48:09,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:09,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 02:48:09,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 02:48:09,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:09,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:48:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145555582] [2025-03-09 02:48:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145555582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:09,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:09,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:09,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959333153] [2025-03-09 02:48:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:09,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:09,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:09,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:09,977 INFO L87 Difference]: Start difference. First operand 3918 states and 4952 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-09 02:48:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:10,053 INFO L93 Difference]: Finished difference Result 4374 states and 5538 transitions. [2025-03-09 02:48:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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) Word has length 87 [2025-03-09 02:48:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:10,056 INFO L225 Difference]: With dead ends: 4374 [2025-03-09 02:48:10,056 INFO L226 Difference]: Without dead ends: 1467 [2025-03-09 02:48:10,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:10,058 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:10,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 249 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-09 02:48:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2025-03-09 02:48:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1464 states have (on average 1.2363387978142077) internal successors, (1810), 1466 states have internal predecessors, (1810), 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-09 02:48:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1810 transitions. [2025-03-09 02:48:10,076 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1810 transitions. Word has length 87 [2025-03-09 02:48:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:10,076 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 1810 transitions. [2025-03-09 02:48:10,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-09 02:48:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1810 transitions. [2025-03-09 02:48:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 02:48:10,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:10,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:10,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 02:48:10,078 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 02:48:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 112374787, now seen corresponding path program 1 times [2025-03-09 02:48:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599633567] [2025-03-09 02:48:10,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:10,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 02:48:10,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:48:10,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:48:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:10,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599633567] [2025-03-09 02:48:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599633567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:10,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:10,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658616618] [2025-03-09 02:48:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:10,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:10,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:10,154 INFO L87 Difference]: Start difference. First operand 1467 states and 1810 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-09 02:48:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:10,237 INFO L93 Difference]: Finished difference Result 1467 states and 1810 transitions. [2025-03-09 02:48:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:10,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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) Word has length 88 [2025-03-09 02:48:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:10,238 INFO L225 Difference]: With dead ends: 1467 [2025-03-09 02:48:10,238 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:48:10,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:10,240 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 106 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:10,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 240 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:48:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:48:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-09 02:48:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:48:10,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2025-03-09 02:48:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:10,240 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:48:10,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-09 02:48:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:48:10,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-03-09 02:48:10,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-03-09 02:48:10,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 02:48:10,245 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:10,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:48:14,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:48:14,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:48:14 BoogieIcfgContainer [2025-03-09 02:48:14,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:48:14,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:48:14,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:48:14,540 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:48:14,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:00" (3/4) ... [2025-03-09 02:48:14,542 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:48:14,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:48:14,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:48:14,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:48:14,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:48:14,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:48:14,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:48:14,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:48:14,627 INFO L158 Benchmark]: Toolchain (without parser) took 14898.25ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 112.9MB in the beginning and 704.8MB in the end (delta: -592.0MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. [2025-03-09 02:48:14,628 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:14,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.71ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:14,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:14,628 INFO L158 Benchmark]: Boogie Preprocessor took 24.88ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:14,629 INFO L158 Benchmark]: IcfgBuilder took 421.23ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.4MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:48:14,631 INFO L158 Benchmark]: TraceAbstraction took 14157.88ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 73.4MB in the beginning and 713.2MB in the end (delta: -639.7MB). Peak memory consumption was 513.7MB. Max. memory is 16.1GB. [2025-03-09 02:48:14,631 INFO L158 Benchmark]: Witness Printer took 86.68ms. Allocated memory is still 906.0MB. Free memory was 713.2MB in the beginning and 704.8MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:14,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.71ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.88ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 421.23ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.4MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14157.88ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 73.4MB in the beginning and 713.2MB in the end (delta: -639.7MB). Peak memory consumption was 513.7MB. Max. memory is 16.1GB. * Witness Printer took 86.68ms. Allocated memory is still 906.0MB. Free memory was 713.2MB in the beginning and 704.8MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 118 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 31, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4484 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4484 mSDsluCounter, 7488 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3761 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2837 IncrementalHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 3727 mSDtfsCounter, 2837 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9169occurred in iteration=21, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 6633 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1846 NumberOfCodeBlocks, 1846 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1814 ConstructedInterpolants, 0 QuantifiedInterpolants, 6954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 32 InterpolantComputations, 31 PerfectInterpolantSequences, 434/438 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 259]: Location Invariant Derived location invariant: (((((((((st1 == 1) && (st3 == 1)) && (st2 == 0)) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && (st2 == 1)) && (st3 <= 1)) && (0 <= st3))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:48:14,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE