./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.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/loop-lit/gj2007.c.i.p+lhb-reducer.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 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:57:09,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:57:09,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:57:09,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:57:09,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:57:09,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:57:09,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:57:09,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:57:09,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:57:09,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:57:09,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:57:09,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:57:09,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:57:09,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:57:09,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:57:09,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:57:09,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:09,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:57:09,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:57:09,280 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 -> 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 [2025-03-09 01:57:09,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:57:09,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:57:09,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:57:09,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:57:09,510 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:57:09,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2025-03-09 01:57:10,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b738389/9ccbaf2090e84047abb74deae252b3b5/FLAG371d7c5af [2025-03-09 01:57:10,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:57:10,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2025-03-09 01:57:10,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b738389/9ccbaf2090e84047abb74deae252b3b5/FLAG371d7c5af [2025-03-09 01:57:11,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b738389/9ccbaf2090e84047abb74deae252b3b5 [2025-03-09 01:57:11,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:57:11,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:57:11,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:11,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:57:11,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:57:11,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcac6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11, skipping insertion in model container [2025-03-09 01:57:11,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:57:11,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:11,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:57:11,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:11,400 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:57:11,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11 WrapperNode [2025-03-09 01:57:11,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:11,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:11,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:57:11,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:57:11,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,434 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2025-03-09 01:57:11,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:11,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:57:11,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:57:11,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:57:11,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,460 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 01:57:11,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:57:11,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:57:11,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:57:11,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:57:11,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (1/1) ... [2025-03-09 01:57:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:11,504 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 01:57:11,507 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 01:57:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:57:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:57:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:57:11,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:57:11,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:57:11,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:57:11,806 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-09 01:57:11,821 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-09 01:57:11,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:57:11,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:57:11,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:57:11,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:11 BoogieIcfgContainer [2025-03-09 01:57:11,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:57:11,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:57:11,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:57:11,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:57:11,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:57:11" (1/3) ... [2025-03-09 01:57:11,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac22d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:11, skipping insertion in model container [2025-03-09 01:57:11,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:11" (2/3) ... [2025-03-09 01:57:11,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac22d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:11, skipping insertion in model container [2025-03-09 01:57:11,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:11" (3/3) ... [2025-03-09 01:57:11,839 INFO L128 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2025-03-09 01:57:11,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:57:11,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gj2007.c.i.p+lhb-reducer.c that has 1 procedures, 147 locations, 1 initial locations, 0 loop locations, and 60 error locations. [2025-03-09 01:57:11,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:57:11,896 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;@3f29f2b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:57:11,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-09 01:57:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 86 states have (on average 1.941860465116279) internal successors, (167), 146 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 01:57:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:57:11,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:11,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:57:11,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:11,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash 208006576, now seen corresponding path program 1 times [2025-03-09 01:57:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941976156] [2025-03-09 01:57:11,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:11,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:57:11,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:57:11,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:11,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,018 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 01:57:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941976156] [2025-03-09 01:57:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941976156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702807160] [2025-03-09 01:57:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:12,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:12,038 INFO L87 Difference]: Start difference. First operand has 147 states, 86 states have (on average 1.941860465116279) internal successors, (167), 146 states have internal predecessors, (167), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states 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 01:57:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,188 INFO L93 Difference]: Finished difference Result 277 states and 315 transitions. [2025-03-09 01:57:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-09 01:57:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,195 INFO L225 Difference]: With dead ends: 277 [2025-03-09 01:57:12,195 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 01:57:12,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:57:12,198 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 01:57:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-09 01:57:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 131 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 01:57:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-09 01:57:12,225 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 5 [2025-03-09 01:57:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-09 01:57:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states 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 01:57:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-09 01:57:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:57:12,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:12,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:12,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:57:12,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:12,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1738071044, now seen corresponding path program 1 times [2025-03-09 01:57:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:12,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866579234] [2025-03-09 01:57:12,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:12,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:57:12,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:57:12,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:12,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,271 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 01:57:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866579234] [2025-03-09 01:57:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866579234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156860526] [2025-03-09 01:57:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:12,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:12,274 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 01:57:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,445 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-09 01:57:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-09 01:57:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,446 INFO L225 Difference]: With dead ends: 132 [2025-03-09 01:57:12,446 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 01:57:12,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:12,446 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 76 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:57:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 01:57:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-09 01:57:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 113 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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 01:57:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-03-09 01:57:12,453 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 9 [2025-03-09 01:57:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,454 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-03-09 01:57:12,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 01:57:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-03-09 01:57:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:57:12,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:12,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:57:12,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1954372363, now seen corresponding path program 1 times [2025-03-09 01:57:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043793205] [2025-03-09 01:57:12,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:12,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:57:12,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:57:12,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:12,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,507 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 01:57:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043793205] [2025-03-09 01:57:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043793205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998852285] [2025-03-09 01:57:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:12,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:12,509 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 01:57:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,595 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2025-03-09 01:57:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:12,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 01:57:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,596 INFO L225 Difference]: With dead ends: 114 [2025-03-09 01:57:12,597 INFO L226 Difference]: Without dead ends: 96 [2025-03-09 01:57:12,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:57:12,597 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 84 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-09 01:57:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-09 01:57:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 01:57:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-09 01:57:12,606 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 10 [2025-03-09 01:57:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,606 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-09 01:57:12,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 01:57:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-09 01:57:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:57:12,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:12,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:12,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:57:12,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:12,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash -455962262, now seen corresponding path program 1 times [2025-03-09 01:57:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598748411] [2025-03-09 01:57:12,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:12,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:57:12,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:57:12,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:12,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:12,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598748411] [2025-03-09 01:57:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598748411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:57:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929753813] [2025-03-09 01:57:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:12,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:12,662 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 01:57:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,733 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2025-03-09 01:57:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-03-09 01:57:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,734 INFO L225 Difference]: With dead ends: 176 [2025-03-09 01:57:12,734 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 01:57:12,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:57:12,735 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 01:57:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 01:57:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 89 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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 01:57:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-03-09 01:57:12,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 11 [2025-03-09 01:57:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-03-09 01:57:12,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 01:57:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-03-09 01:57:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:57:12,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:12,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:57:12,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -647423490, now seen corresponding path program 1 times [2025-03-09 01:57:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663926962] [2025-03-09 01:57:12,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:12,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:57:12,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:57:12,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:12,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,790 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 01:57:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663926962] [2025-03-09 01:57:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663926962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891923292] [2025-03-09 01:57:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:12,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:12,792 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 01:57:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,823 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-03-09 01:57:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 01:57:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,824 INFO L225 Difference]: With dead ends: 90 [2025-03-09 01:57:12,824 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 01:57:12,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:57:12,825 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 60 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 01:57:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-09 01:57:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 81 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 01:57:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-09 01:57:12,832 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2025-03-09 01:57:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-09 01:57:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 01:57:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-09 01:57:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:57:12,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:12,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:57:12,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1404708398, now seen corresponding path program 1 times [2025-03-09 01:57:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786625186] [2025-03-09 01:57:12,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:12,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:57:12,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:57:12,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:12,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,876 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 01:57:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786625186] [2025-03-09 01:57:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786625186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418370654] [2025-03-09 01:57:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:12,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:12,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:12,880 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 01:57:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,917 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2025-03-09 01:57:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-09 01:57:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,918 INFO L225 Difference]: With dead ends: 145 [2025-03-09 01:57:12,918 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 01:57:12,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:57:12,919 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 59 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 01:57:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-09 01:57:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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 01:57:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2025-03-09 01:57:12,923 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 16 [2025-03-09 01:57:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,923 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2025-03-09 01:57:12,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 01:57:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2025-03-09 01:57:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:57:12,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:12,924 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] [2025-03-09 01:57:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:57:12,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2112699929, now seen corresponding path program 1 times [2025-03-09 01:57:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431654010] [2025-03-09 01:57:12,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:12,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:57:12,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:57:12,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:12,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:12,968 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 01:57:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431654010] [2025-03-09 01:57:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431654010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:12,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:12,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:12,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747474427] [2025-03-09 01:57:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:12,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:12,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:12,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:12,970 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 01:57:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,016 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2025-03-09 01:57:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:13,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-09 01:57:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,017 INFO L225 Difference]: With dead ends: 191 [2025-03-09 01:57:13,017 INFO L226 Difference]: Without dead ends: 184 [2025-03-09 01:57:13,018 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 01:57:13,018 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 110 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 165 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-09 01:57:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-09 01:57:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 178 states have (on average 1.151685393258427) internal successors, (205), 183 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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 01:57:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2025-03-09 01:57:13,028 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 22 [2025-03-09 01:57:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,028 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2025-03-09 01:57:13,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 01:57:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2025-03-09 01:57:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:57:13,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,029 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] [2025-03-09 01:57:13,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:57:13,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash 250517536, now seen corresponding path program 1 times [2025-03-09 01:57:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468321999] [2025-03-09 01:57:13,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:57:13,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:57:13,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:13,085 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 01:57:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:13,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468321999] [2025-03-09 01:57:13,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468321999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:13,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:13,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:57:13,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660032585] [2025-03-09 01:57:13,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:13,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:57:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:13,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:57:13,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:57:13,087 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 01:57:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,153 INFO L93 Difference]: Finished difference Result 229 states and 255 transitions. [2025-03-09 01:57:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:57:13,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-09 01:57:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,154 INFO L225 Difference]: With dead ends: 229 [2025-03-09 01:57:13,154 INFO L226 Difference]: Without dead ends: 223 [2025-03-09 01:57:13,154 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 01:57:13,155 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 153 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 200 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-09 01:57:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-09 01:57:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.1422018348623852) internal successors, (249), 222 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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 01:57:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2025-03-09 01:57:13,168 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 28 [2025-03-09 01:57:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2025-03-09 01:57:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 01:57:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2025-03-09 01:57:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:57:13,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,169 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] [2025-03-09 01:57:13,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:57:13,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1754777817, now seen corresponding path program 1 times [2025-03-09 01:57:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054855044] [2025-03-09 01:57:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:57:13,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:57:13,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:13,218 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 01:57:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054855044] [2025-03-09 01:57:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054855044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:57:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808730262] [2025-03-09 01:57:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:13,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:57:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:13,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:57:13,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:57:13,232 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:57:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,306 INFO L93 Difference]: Finished difference Result 347 states and 388 transitions. [2025-03-09 01:57:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:57:13,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-09 01:57:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,307 INFO L225 Difference]: With dead ends: 347 [2025-03-09 01:57:13,307 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 01:57:13,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 01:57:13,308 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 01:57:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-09 01:57:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 190 states have (on average 1.1368421052631579) internal successors, (216), 193 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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 01:57:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2025-03-09 01:57:13,312 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 34 [2025-03-09 01:57:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,312 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2025-03-09 01:57:13,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 01:57:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2025-03-09 01:57:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 01:57:13,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,312 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, 1] [2025-03-09 01:57:13,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:57:13,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -871503245, now seen corresponding path program 1 times [2025-03-09 01:57:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54506952] [2025-03-09 01:57:13,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:57:13,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:57:13,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:13,377 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 01:57:13,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54506952] [2025-03-09 01:57:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54506952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:57:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288430593] [2025-03-09 01:57:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:13,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:13,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:13,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:13,379 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:57:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,447 INFO L93 Difference]: Finished difference Result 293 states and 327 transitions. [2025-03-09 01:57:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-09 01:57:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,449 INFO L225 Difference]: With dead ends: 293 [2025-03-09 01:57:13,449 INFO L226 Difference]: Without dead ends: 165 [2025-03-09 01:57:13,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:13,449 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-09 01:57:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-09 01:57:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 1.1296296296296295) internal successors, (183), 164 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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 01:57:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2025-03-09 01:57:13,452 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 38 [2025-03-09 01:57:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2025-03-09 01:57:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 01:57:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2025-03-09 01:57:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 01:57:13,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,454 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, 1, 1, 1, 1, 1] [2025-03-09 01:57:13,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:57:13,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1576876685, now seen corresponding path program 1 times [2025-03-09 01:57:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168564434] [2025-03-09 01:57:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:57:13,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:57:13,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:13,518 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 01:57:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168564434] [2025-03-09 01:57:13,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168564434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:13,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:13,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:57:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561362680] [2025-03-09 01:57:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:13,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:57:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:13,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:57:13,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:57:13,520 INFO L87 Difference]: Start difference. First operand 165 states and 183 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:57:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,588 INFO L93 Difference]: Finished difference Result 239 states and 266 transitions. [2025-03-09 01:57:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:57:13,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-09 01:57:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,589 INFO L225 Difference]: With dead ends: 239 [2025-03-09 01:57:13,589 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 01:57:13,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:57:13,591 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 01:57:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-09 01:57:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 135 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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 01:57:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-03-09 01:57:13,594 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 42 [2025-03-09 01:57:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,595 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-03-09 01:57:13,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 01:57:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-03-09 01:57:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:57:13,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:57:13,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -919963353, now seen corresponding path program 1 times [2025-03-09 01:57:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939337115] [2025-03-09 01:57:13,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:57:13,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:57:13,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:13,694 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 01:57:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939337115] [2025-03-09 01:57:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939337115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:13,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:57:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497155728] [2025-03-09 01:57:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:57:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:13,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:57:13,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:13,696 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 01:57:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,752 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2025-03-09 01:57:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:57:13,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-09 01:57:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,753 INFO L225 Difference]: With dead ends: 185 [2025-03-09 01:57:13,753 INFO L226 Difference]: Without dead ends: 107 [2025-03-09 01:57:13,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:13,754 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-09 01:57:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-09 01:57:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 106 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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 01:57:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2025-03-09 01:57:13,756 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 46 [2025-03-09 01:57:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,756 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2025-03-09 01:57:13,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 01:57:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2025-03-09 01:57:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:57:13,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:13,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:57:13,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1202820988, now seen corresponding path program 1 times [2025-03-09 01:57:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687854715] [2025-03-09 01:57:13,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:57:13,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:57:13,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:13,859 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 01:57:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687854715] [2025-03-09 01:57:13,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687854715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:13,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:13,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:57:13,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256180144] [2025-03-09 01:57:13,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:13,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:57:13,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:13,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:57:13,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:57:13,860 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 01:57:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:13,957 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2025-03-09 01:57:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:57:13,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-09 01:57:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:13,958 INFO L225 Difference]: With dead ends: 140 [2025-03-09 01:57:13,958 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 01:57:13,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:57:13,958 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:13,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 01:57:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-09 01:57:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 01:57:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-03-09 01:57:13,960 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 50 [2025-03-09 01:57:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:13,960 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-03-09 01:57:13,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 01:57:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-03-09 01:57:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 01:57:13,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:13,961 INFO L218 NwaCegarLoop]: trace histogram [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 01:57:13,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:57:13,961 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:13,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1355047633, now seen corresponding path program 1 times [2025-03-09 01:57:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158655914] [2025-03-09 01:57:13,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:13,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 01:57:13,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:57:13,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:13,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:57:14,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:14,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158655914] [2025-03-09 01:57:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158655914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:57:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082261247] [2025-03-09 01:57:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:57:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:14,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:57:14,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:14,046 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 01:57:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:14,101 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2025-03-09 01:57:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2025-03-09 01:57:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:14,101 INFO L225 Difference]: With dead ends: 112 [2025-03-09 01:57:14,101 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 01:57:14,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:14,102 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:14,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 01:57:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 01:57:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 01:57:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-03-09 01:57:14,103 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 54 [2025-03-09 01:57:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:14,103 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-03-09 01:57:14,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 01:57:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-03-09 01:57:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:57:14,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:14,104 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:14,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:57:14,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -931218650, now seen corresponding path program 1 times [2025-03-09 01:57:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723795867] [2025-03-09 01:57:14,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:14,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:57:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:57:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:57:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:14,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723795867] [2025-03-09 01:57:14,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723795867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:14,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:14,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:57:14,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330133293] [2025-03-09 01:57:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:14,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:57:14,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:14,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:57:14,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:57:14,212 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 01:57:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:14,261 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2025-03-09 01:57:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:57:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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 01:57:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:14,262 INFO L225 Difference]: With dead ends: 100 [2025-03-09 01:57:14,262 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 01:57:14,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:57:14,262 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:14,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 01:57:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 01:57:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 01:57:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2025-03-09 01:57:14,264 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 58 [2025-03-09 01:57:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:14,264 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2025-03-09 01:57:14,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 01:57:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2025-03-09 01:57:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 01:57:14,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:14,264 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:14,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:57:14,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:14,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2067496837, now seen corresponding path program 1 times [2025-03-09 01:57:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491343692] [2025-03-09 01:57:14,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:14,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 01:57:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 01:57:14,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:14,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:14,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491343692] [2025-03-09 01:57:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491343692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:14,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:57:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272322178] [2025-03-09 01:57:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:14,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:57:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:14,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:57:14,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:14,373 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 01:57:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:14,441 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-03-09 01:57:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:57:14,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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 01:57:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:14,442 INFO L225 Difference]: With dead ends: 104 [2025-03-09 01:57:14,442 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 01:57:14,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:14,443 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:14,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 01:57:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-09 01:57:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 01:57:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-03-09 01:57:14,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 62 [2025-03-09 01:57:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:14,446 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-03-09 01:57:14,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 01:57:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-03-09 01:57:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:57:14,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:14,447 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:57:14,447 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1041879504, now seen corresponding path program 1 times [2025-03-09 01:57:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514654472] [2025-03-09 01:57:14,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:14,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:57:14,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:57:14,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:14,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:14,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514654472] [2025-03-09 01:57:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514654472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:14,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644283642] [2025-03-09 01:57:14,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:14,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:14,599 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 01:57:14,601 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 01:57:14,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:57:14,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:57:14,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:14,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:14,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:57:14,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:14,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644283642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:14,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-09 01:57:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942972310] [2025-03-09 01:57:14,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:57:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:14,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:57:14,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:57:14,937 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 01:57:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:15,051 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2025-03-09 01:57:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:57:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 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 01:57:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:15,051 INFO L225 Difference]: With dead ends: 150 [2025-03-09 01:57:15,051 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 01:57:15,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:57:15,052 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:15,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 20 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 01:57:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-09 01:57:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 01:57:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2025-03-09 01:57:15,055 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 66 [2025-03-09 01:57:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:15,055 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2025-03-09 01:57:15,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 01:57:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2025-03-09 01:57:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 01:57:15,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:15,057 INFO L218 NwaCegarLoop]: trace histogram [17, 13, 13, 13, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:15,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:57:15,257 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,SelfDestructingSolverStorable16 [2025-03-09 01:57:15,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:15,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -34549844, now seen corresponding path program 2 times [2025-03-09 01:57:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391015689] [2025-03-09 01:57:15,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:15,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-09 01:57:15,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 01:57:15,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:15,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 84 proven. 338 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391015689] [2025-03-09 01:57:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391015689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076978159] [2025-03-09 01:57:15,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:15,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:15,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:57:15,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-09 01:57:15,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 01:57:15,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:15,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:15,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 01:57:15,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 84 proven. 338 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:15,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 84 proven. 338 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:57:16,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076978159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:16,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-09 01:57:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214328353] [2025-03-09 01:57:16,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:16,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-09 01:57:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:16,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-09 01:57:16,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 01:57:16,681 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 49 states, 49 states have (on average 3.979591836734694) internal successors, (195), 49 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:16,879 INFO L93 Difference]: Finished difference Result 246 states and 277 transitions. [2025-03-09 01:57:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 01:57:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.979591836734694) internal successors, (195), 49 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-09 01:57:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:16,882 INFO L225 Difference]: With dead ends: 246 [2025-03-09 01:57:16,882 INFO L226 Difference]: Without dead ends: 217 [2025-03-09 01:57:16,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 01:57:16,883 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:16,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 28 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:57:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-09 01:57:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-09 01:57:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.0231481481481481) internal successors, (221), 216 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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 01:57:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2025-03-09 01:57:16,887 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 114 [2025-03-09 01:57:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:16,887 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2025-03-09 01:57:16,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.979591836734694) internal successors, (195), 49 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2025-03-09 01:57:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-09 01:57:16,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:16,888 INFO L218 NwaCegarLoop]: trace histogram [41, 37, 37, 37, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:16,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:17,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:57:17,088 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:17,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash 653777572, now seen corresponding path program 3 times [2025-03-09 01:57:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:17,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-09 01:57:17,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:17,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 210 statements into 39 equivalence classes. [2025-03-09 01:57:17,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 74 of 210 statements. [2025-03-09 01:57:17,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:57:17,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2996 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-09 01:57:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-09 01:57:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737421442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41491224] [2025-03-09 01:57:17,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:17,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:17,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:57:17,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 210 statements into 39 equivalence classes. [2025-03-09 01:57:17,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 74 of 210 statements. [2025-03-09 01:57:17,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:57:17,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:17,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:17,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2996 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-09 01:57:17,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2996 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-09 01:57:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41491224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:17,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 01:57:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480848553] [2025-03-09 01:57:17,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:57:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:17,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:57:17,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:17,565 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 01:57:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:17,582 INFO L93 Difference]: Finished difference Result 258 states and 271 transitions. [2025-03-09 01:57:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 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 210 [2025-03-09 01:57:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:17,584 INFO L225 Difference]: With dead ends: 258 [2025-03-09 01:57:17,584 INFO L226 Difference]: Without dead ends: 257 [2025-03-09 01:57:17,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:17,584 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:17,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-09 01:57:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-09 01:57:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.0390625) internal successors, (266), 256 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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 01:57:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 266 transitions. [2025-03-09 01:57:17,588 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 266 transitions. Word has length 210 [2025-03-09 01:57:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:17,588 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 266 transitions. [2025-03-09 01:57:17,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 01:57:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 266 transitions. [2025-03-09 01:57:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-09 01:57:17,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:17,589 INFO L218 NwaCegarLoop]: trace histogram [46, 37, 37, 37, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:17,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:57:17,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:17,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:17,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 584775784, now seen corresponding path program 4 times [2025-03-09 01:57:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:17,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529285414] [2025-03-09 01:57:17,791 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:57:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:17,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 240 statements into 2 equivalence classes. [2025-03-09 01:57:17,821 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 240 of 240 statements. [2025-03-09 01:57:17,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:57:17,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3546 backedges. 608 proven. 2738 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-09 01:57:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529285414] [2025-03-09 01:57:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529285414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220711657] [2025-03-09 01:57:19,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:57:19,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:19,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:19,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:57:19,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 240 statements into 2 equivalence classes. [2025-03-09 01:57:19,058 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 240 of 240 statements. [2025-03-09 01:57:19,058 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:57:19,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:19,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 01:57:19,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3546 backedges. 608 proven. 2738 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-09 01:57:19,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3546 backedges. 608 proven. 2738 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-09 01:57:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220711657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:20,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 53 [2025-03-09 01:57:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553455440] [2025-03-09 01:57:20,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:20,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-09 01:57:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:20,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-09 01:57:20,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 01:57:20,245 INFO L87 Difference]: Start difference. First operand 257 states and 266 transitions. Second operand has 53 states, 53 states have (on average 4.716981132075472) internal successors, (250), 53 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 01:57:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:20,434 INFO L93 Difference]: Finished difference Result 342 states and 363 transitions. [2025-03-09 01:57:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-09 01:57:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.716981132075472) internal successors, (250), 53 states have internal predecessors, (250), 0 states have call successors, (0), 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 240 [2025-03-09 01:57:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:20,435 INFO L225 Difference]: With dead ends: 342 [2025-03-09 01:57:20,435 INFO L226 Difference]: Without dead ends: 273 [2025-03-09 01:57:20,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 432 SyntacticMatches, 44 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 01:57:20,437 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:20,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:57:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-09 01:57:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-09 01:57:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.036764705882353) internal successors, (282), 272 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 01:57:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 282 transitions. [2025-03-09 01:57:20,443 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 282 transitions. Word has length 240 [2025-03-09 01:57:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:20,443 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 282 transitions. [2025-03-09 01:57:20,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.716981132075472) internal successors, (250), 53 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 01:57:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 282 transitions. [2025-03-09 01:57:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-09 01:57:20,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,445 INFO L218 NwaCegarLoop]: trace histogram [50, 41, 41, 41, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:20,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:57:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:20,646 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1850934076, now seen corresponding path program 5 times [2025-03-09 01:57:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775311712] [2025-03-09 01:57:20,646 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:57:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:20,652 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 256 statements into 43 equivalence classes. [2025-03-09 01:57:20,682 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) and asserted 256 of 256 statements. [2025-03-09 01:57:20,682 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2025-03-09 01:57:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775311712] [2025-03-09 01:57:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775311712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56750391] [2025-03-09 01:57:20,824 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:57:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:20,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:20,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:57:20,856 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 256 statements into 43 equivalence classes. [2025-03-09 01:57:20,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) and asserted 256 of 256 statements. [2025-03-09 01:57:20,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2025-03-09 01:57:20,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:57:20,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:21,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56750391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:21,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-09 01:57:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802578509] [2025-03-09 01:57:21,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:21,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:57:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:21,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:57:21,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:57:21,401 INFO L87 Difference]: Start difference. First operand 273 states and 282 transitions. Second operand has 20 states, 19 states have (on average 9.947368421052632) internal successors, (189), 20 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 01:57:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:21,439 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2025-03-09 01:57:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:57:21,439 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 9.947368421052632) internal successors, (189), 20 states have internal predecessors, (189), 0 states have call successors, (0), 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 256 [2025-03-09 01:57:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:21,440 INFO L225 Difference]: With dead ends: 354 [2025-03-09 01:57:21,440 INFO L226 Difference]: Without dead ends: 353 [2025-03-09 01:57:21,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:57:21,441 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:21,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 176 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-09 01:57:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-09 01:57:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.0568181818181819) internal successors, (372), 352 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 01:57:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 372 transitions. [2025-03-09 01:57:21,447 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 372 transitions. Word has length 256 [2025-03-09 01:57:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:21,447 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 372 transitions. [2025-03-09 01:57:21,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.947368421052632) internal successors, (189), 20 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 01:57:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 372 transitions. [2025-03-09 01:57:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-09 01:57:21,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:21,450 INFO L218 NwaCegarLoop]: trace histogram [60, 41, 41, 41, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:21,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:57:21,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:21,651 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1137894460, now seen corresponding path program 6 times [2025-03-09 01:57:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:21,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200086] [2025-03-09 01:57:21,651 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:57:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:21,661 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 316 statements into 43 equivalence classes. [2025-03-09 01:57:21,689 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) and asserted 300 of 316 statements. [2025-03-09 01:57:21,690 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2025-03-09 01:57:21,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 0 proven. 2502 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200086] [2025-03-09 01:57:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853141811] [2025-03-09 01:57:22,128 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:57:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:22,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:22,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:57:22,157 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 316 statements into 43 equivalence classes. [2025-03-09 01:57:22,212 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) and asserted 300 of 316 statements. [2025-03-09 01:57:22,212 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2025-03-09 01:57:22,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:57:22,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 0 proven. 2502 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:22,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 0 proven. 2502 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853141811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:23,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-03-09 01:57:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465890004] [2025-03-09 01:57:23,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:23,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:57:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:23,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:57:23,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:57:23,009 INFO L87 Difference]: Start difference. First operand 353 states and 372 transitions. Second operand has 40 states, 39 states have (on average 7.923076923076923) internal successors, (309), 40 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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 01:57:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:23,132 INFO L93 Difference]: Finished difference Result 514 states and 572 transitions. [2025-03-09 01:57:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 01:57:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 7.923076923076923) internal successors, (309), 40 states have internal predecessors, (309), 0 states have call successors, (0), 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 316 [2025-03-09 01:57:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:23,134 INFO L225 Difference]: With dead ends: 514 [2025-03-09 01:57:23,134 INFO L226 Difference]: Without dead ends: 513 [2025-03-09 01:57:23,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:57:23,135 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 249 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:23,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 320 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-09 01:57:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-03-09 01:57:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.078125) internal successors, (552), 512 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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 01:57:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 552 transitions. [2025-03-09 01:57:23,141 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 552 transitions. Word has length 316 [2025-03-09 01:57:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:23,141 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 552 transitions. [2025-03-09 01:57:23,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 7.923076923076923) internal successors, (309), 40 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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 01:57:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 552 transitions. [2025-03-09 01:57:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-09 01:57:23,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:23,144 INFO L218 NwaCegarLoop]: trace histogram [80, 41, 41, 41, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:23,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:23,348 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:23,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1117722836, now seen corresponding path program 7 times [2025-03-09 01:57:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444019228] [2025-03-09 01:57:23,349 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:57:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:23,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-09 01:57:23,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-09 01:57:23,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:23,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 0 proven. 7562 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:24,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444019228] [2025-03-09 01:57:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444019228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:24,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874489184] [2025-03-09 01:57:24,499 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:57:24,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:24,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:24,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:24,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:57:24,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-09 01:57:24,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-09 01:57:24,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:24,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:24,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:57:24,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 0 proven. 7562 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:24,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 0 proven. 7562 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874489184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:26,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2025-03-09 01:57:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138448010] [2025-03-09 01:57:26,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-03-09 01:57:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:26,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-03-09 01:57:26,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2025-03-09 01:57:26,418 INFO L87 Difference]: Start difference. First operand 513 states and 552 transitions. Second operand has 80 states, 79 states have (on average 6.949367088607595) internal successors, (549), 80 states have internal predecessors, (549), 0 states have call successors, (0), 0 states 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 01:57:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:26,946 INFO L93 Difference]: Finished difference Result 834 states and 952 transitions. [2025-03-09 01:57:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-09 01:57:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 6.949367088607595) internal successors, (549), 80 states have internal predecessors, (549), 0 states have call successors, (0), 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 436 [2025-03-09 01:57:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:26,948 INFO L225 Difference]: With dead ends: 834 [2025-03-09 01:57:26,949 INFO L226 Difference]: Without dead ends: 833 [2025-03-09 01:57:26,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2025-03-09 01:57:26,950 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 696 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:26,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 599 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-09 01:57:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-09 01:57:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.0961538461538463) internal successors, (912), 832 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 01:57:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 912 transitions. [2025-03-09 01:57:26,959 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 912 transitions. Word has length 436 [2025-03-09 01:57:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:26,959 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 912 transitions. [2025-03-09 01:57:26,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 6.949367088607595) internal successors, (549), 80 states have internal predecessors, (549), 0 states have call successors, (0), 0 states 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 01:57:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 912 transitions. [2025-03-09 01:57:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2025-03-09 01:57:26,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:26,966 INFO L218 NwaCegarLoop]: trace histogram [120, 79, 79, 79, 79, 78, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:26,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:27,170 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 01:57:27,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -449690892, now seen corresponding path program 8 times [2025-03-09 01:57:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048245458] [2025-03-09 01:57:27,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:27,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 676 statements into 2 equivalence classes. [2025-03-09 01:57:27,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 676 of 676 statements. [2025-03-09 01:57:27,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28244 backedges. 0 proven. 24882 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-09 01:57:30,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048245458] [2025-03-09 01:57:30,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048245458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181410664] [2025-03-09 01:57:30,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:30,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:30,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:30,905 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:30,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:57:30,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 676 statements into 2 equivalence classes. [2025-03-09 01:57:31,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 676 of 676 statements. [2025-03-09 01:57:31,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:31,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-09 01:57:31,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28244 backedges. 22474 proven. 0 refuted. 0 times theorem prover too weak. 5770 trivial. 0 not checked. [2025-03-09 01:57:33,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181410664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [80] total 132 [2025-03-09 01:57:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831611239] [2025-03-09 01:57:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-09 01:57:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-09 01:57:33,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4617, Invalid=12675, Unknown=0, NotChecked=0, Total=17292 [2025-03-09 01:57:33,147 INFO L87 Difference]: Start difference. First operand 833 states and 912 transitions. Second operand has 53 states, 53 states have (on average 6.584905660377358) internal successors, (349), 53 states have internal predecessors, (349), 0 states have call successors, (0), 0 states 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 01:57:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,630 INFO L93 Difference]: Finished difference Result 1128 states and 1256 transitions. [2025-03-09 01:57:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-09 01:57:33,631 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 6.584905660377358) internal successors, (349), 53 states have internal predecessors, (349), 0 states have call successors, (0), 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 676 [2025-03-09 01:57:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,631 INFO L225 Difference]: With dead ends: 1128 [2025-03-09 01:57:33,631 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:57:33,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3978 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4617, Invalid=12675, Unknown=0, NotChecked=0, Total=17292 [2025-03-09 01:57:33,636 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:57:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:57:33,637 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 01:57:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:57:33,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 676 [2025-03-09 01:57:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,637 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:57:33,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.584905660377358) internal successors, (349), 53 states have internal predecessors, (349), 0 states have call successors, (0), 0 states 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 01:57:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:57:33,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:57:33,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 60 remaining) [2025-03-09 01:57:33,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 60 remaining) [2025-03-09 01:57:33,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 60 remaining) [2025-03-09 01:57:33,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 60 remaining) [2025-03-09 01:57:33,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 60 remaining) [2025-03-09 01:57:33,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 60 remaining) [2025-03-09 01:57:33,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 60 remaining) [2025-03-09 01:57:33,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 60 remaining) [2025-03-09 01:57:33,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:33,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:57:33,848 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:33,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:57:33,853 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:57:33,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:57:33 BoogieIcfgContainer [2025-03-09 01:57:33,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:57:33,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:57:33,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:57:33,861 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:57:33,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:11" (3/4) ... [2025-03-09 01:57:33,864 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:57:33,873 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 01:57:33,873 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:57:33,873 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:57:33,873 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:57:33,941 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:57:33,942 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:57:33,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:57:33,942 INFO L158 Benchmark]: Toolchain (without parser) took 22725.92ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 105.5MB in the beginning and 503.1MB in the end (delta: -397.6MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-03-09 01:57:33,943 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:33,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.89ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:33,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.40ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.6MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:33,944 INFO L158 Benchmark]: Boogie Preprocessor took 32.10ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:33,944 INFO L158 Benchmark]: IcfgBuilder took 362.07ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 70.7MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:57:33,944 INFO L158 Benchmark]: TraceAbstraction took 22026.34ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 69.5MB in the beginning and 512.2MB in the end (delta: -442.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-03-09 01:57:33,944 INFO L158 Benchmark]: Witness Printer took 80.95ms. Allocated memory is still 604.0MB. Free memory was 512.2MB in the beginning and 503.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:33,945 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.72ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.89ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.40ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.6MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.10ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 362.07ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 70.7MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22026.34ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 69.5MB in the beginning and 512.2MB in the end (delta: -442.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 80.95ms. Allocated memory is still 604.0MB. Free memory was 512.2MB in the beginning and 503.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. 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: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 158]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 158]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 193]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 193]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 205]: 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, 147 locations, 167 edges, 60 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 24, TraceHistogramMax: 120, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1721 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 3411 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2167 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4180 IncrementalHoareTripleChecker+Invalid, 4351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 1244 mSDtfsCounter, 4180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4269 GetRequests, 3767 SyntacticMatches, 44 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5368 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=833occurred in iteration=23, InterpolantAutomatonStates: 424, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 5128 NumberOfCodeBlocks, 4824 NumberOfCodeBlocksAsserted, 206 NumberOfCheckSat, 6727 ConstructedInterpolants, 0 QuantifiedInterpolants, 18409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3602 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 73030/140728 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 60 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:57:33,964 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