./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-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+nlh-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 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:57:15,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:57:15,312 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:15,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:57:15,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:57:15,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:57:15,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:57:15,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:57:15,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:57:15,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:57:15,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:57:15,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:57:15,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:57:15,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:57:15,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:57:15,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:57:15,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:57:15,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:57:15,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:57:15,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:57:15,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:57:15,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:57:15,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:57:15,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:57:15,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:15,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:57:15,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:57:15,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:57:15,346 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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf [2025-03-09 01:57:15,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:57:15,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:57:15,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:57:15,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:57:15,584 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:57:15,585 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+nlh-reducer.c [2025-03-09 01:57:16,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25d0646f/6e81a49735aa4bcdb3ccc00a4abdc13e/FLAG851aa7564 [2025-03-09 01:57:16,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:57:16,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2025-03-09 01:57:16,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25d0646f/6e81a49735aa4bcdb3ccc00a4abdc13e/FLAG851aa7564 [2025-03-09 01:57:16,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25d0646f/6e81a49735aa4bcdb3ccc00a4abdc13e [2025-03-09 01:57:16,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:57:16,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:57:16,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:16,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:57:16,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:57:16,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:16" (1/1) ... [2025-03-09 01:57:16,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:16, skipping insertion in model container [2025-03-09 01:57:16,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:16" (1/1) ... [2025-03-09 01:57:16,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:57:17,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:17,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:57:17,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:17,236 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:57:17,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:17 WrapperNode [2025-03-09 01:57:17,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:17,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:17,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:57:17,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:57:17,244 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:17" (1/1) ... [2025-03-09 01:57:17,256 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:17" (1/1) ... [2025-03-09 01:57:17,282 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1046 [2025-03-09 01:57:17,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:17,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:57:17,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:57:17,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:57:17,288 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:17" (1/1) ... [2025-03-09 01:57:17,288 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:17" (1/1) ... [2025-03-09 01:57:17,290 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:17" (1/1) ... [2025-03-09 01:57:17,312 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:17,312 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:17" (1/1) ... [2025-03-09 01:57:17,312 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:17" (1/1) ... [2025-03-09 01:57:17,318 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:17" (1/1) ... [2025-03-09 01:57:17,320 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:17" (1/1) ... [2025-03-09 01:57:17,321 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:17" (1/1) ... [2025-03-09 01:57:17,322 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:17" (1/1) ... [2025-03-09 01:57:17,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:57:17,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:57:17,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:57:17,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:57:17,325 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:17" (1/1) ... [2025-03-09 01:57:17,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:17,358 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:17,365 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:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:57:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:57:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:57:17,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:57:17,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:57:17,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:57:18,306 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-09 01:57:18,332 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-03-09 01:57:18,332 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:57:18,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:57:18,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:57:18,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:18 BoogieIcfgContainer [2025-03-09 01:57:18,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:57:18,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:57:18,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:57:18,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:57:18,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:57:16" (1/3) ... [2025-03-09 01:57:18,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae75dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:18, skipping insertion in model container [2025-03-09 01:57:18,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:17" (2/3) ... [2025-03-09 01:57:18,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae75dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:18, skipping insertion in model container [2025-03-09 01:57:18,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:18" (3/3) ... [2025-03-09 01:57:18,370 INFO L128 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2025-03-09 01:57:18,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:57:18,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gj2007.c.i.p+nlh-reducer.c that has 1 procedures, 959 locations, 1 initial locations, 0 loop locations, and 408 error locations. [2025-03-09 01:57:18,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:57:18,452 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;@15bd1f56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:57:18,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 408 error locations. [2025-03-09 01:57:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 550 states have (on average 1.990909090909091) internal successors, (1095), 958 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:57:18,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:18,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:57:18,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr403ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1204300996, now seen corresponding path program 1 times [2025-03-09 01:57:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329609546] [2025-03-09 01:57:18,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:18,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:57:18,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:57:18,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:18,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:18,584 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:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329609546] [2025-03-09 01:57:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329609546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:18,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:18,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266751111] [2025-03-09 01:57:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:18,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:18,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:18,607 INFO L87 Difference]: Start difference. First operand has 959 states, 550 states have (on average 1.990909090909091) internal successors, (1095), 958 states have internal predecessors, (1095), 0 states have call successors, (0), 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:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:19,394 INFO L93 Difference]: Finished difference Result 1901 states and 2171 transitions. [2025-03-09 01:57:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:19,396 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:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:19,408 INFO L225 Difference]: With dead ends: 1901 [2025-03-09 01:57:19,408 INFO L226 Difference]: Without dead ends: 944 [2025-03-09 01:57:19,412 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:19,414 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:19,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1348 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 01:57:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-09 01:57:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2025-03-09 01:57:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 542 states have (on average 1.8653136531365313) internal successors, (1011), 943 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states 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:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1011 transitions. [2025-03-09 01:57:19,464 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1011 transitions. Word has length 5 [2025-03-09 01:57:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:19,464 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1011 transitions. [2025-03-09 01:57:19,464 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:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1011 transitions. [2025-03-09 01:57:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:57:19,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:19,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:19,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:57:19,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr397ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:19,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:19,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1664625128, now seen corresponding path program 1 times [2025-03-09 01:57:19,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:19,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999462953] [2025-03-09 01:57:19,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:19,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:57:19,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:57:19,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:19,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:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999462953] [2025-03-09 01:57:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999462953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889103353] [2025-03-09 01:57:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:19,521 INFO L87 Difference]: Start difference. First operand 944 states and 1011 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:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:20,317 INFO L93 Difference]: Finished difference Result 944 states and 1011 transitions. [2025-03-09 01:57:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:20,318 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:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:20,321 INFO L225 Difference]: With dead ends: 944 [2025-03-09 01:57:20,321 INFO L226 Difference]: Without dead ends: 810 [2025-03-09 01:57:20,321 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:20,322 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 601 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:20,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 540 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 01:57:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-09 01:57:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2025-03-09 01:57:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 542 states have (on average 1.618081180811808) internal successors, (877), 809 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 877 transitions. [2025-03-09 01:57:20,339 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 877 transitions. Word has length 9 [2025-03-09 01:57:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:20,339 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 877 transitions. [2025-03-09 01:57:20,339 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:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 877 transitions. [2025-03-09 01:57:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:57:20,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:57:20,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr396ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -63770251, now seen corresponding path program 1 times [2025-03-09 01:57:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657538436] [2025-03-09 01:57:20,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:20,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:57:20,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:57:20,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:20,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,371 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:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657538436] [2025-03-09 01:57:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657538436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:20,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617995188] [2025-03-09 01:57:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:20,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:20,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:20,372 INFO L87 Difference]: Start difference. First operand 810 states and 877 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:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:20,866 INFO L93 Difference]: Finished difference Result 810 states and 877 transitions. [2025-03-09 01:57:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:20,866 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:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:20,868 INFO L225 Difference]: With dead ends: 810 [2025-03-09 01:57:20,868 INFO L226 Difference]: Without dead ends: 676 [2025-03-09 01:57:20,869 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:20,869 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 269 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:20,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 606 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-09 01:57:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2025-03-09 01:57:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 542 states have (on average 1.3708487084870848) internal successors, (743), 675 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 743 transitions. [2025-03-09 01:57:20,881 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 743 transitions. Word has length 10 [2025-03-09 01:57:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 743 transitions. [2025-03-09 01:57:20,881 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:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 743 transitions. [2025-03-09 01:57:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:57:20,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:57:20,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr399ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1976837890, now seen corresponding path program 1 times [2025-03-09 01:57:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553803397] [2025-03-09 01:57:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:20,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:57:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:57:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,925 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:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553803397] [2025-03-09 01:57:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553803397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:57:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167631705] [2025-03-09 01:57:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:20,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:20,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:20,927 INFO L87 Difference]: Start difference. First operand 676 states and 743 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:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:21,399 INFO L93 Difference]: Finished difference Result 1336 states and 1469 transitions. [2025-03-09 01:57:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:21,401 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:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:21,403 INFO L225 Difference]: With dead ends: 1336 [2025-03-09 01:57:21,403 INFO L226 Difference]: Without dead ends: 670 [2025-03-09 01:57:21,404 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:21,406 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 2 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:21,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1258 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-09 01:57:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2025-03-09 01:57:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 538 states have (on average 1.3680297397769516) internal successors, (736), 669 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 736 transitions. [2025-03-09 01:57:21,419 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 736 transitions. Word has length 11 [2025-03-09 01:57:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:21,419 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 736 transitions. [2025-03-09 01:57:21,420 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:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 736 transitions. [2025-03-09 01:57:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:57:21,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:21,420 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:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:57:21,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr393ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 483843218, now seen corresponding path program 1 times [2025-03-09 01:57:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503583343] [2025-03-09 01:57:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:21,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:57:21,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:57:21,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,476 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:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503583343] [2025-03-09 01:57:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503583343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955998828] [2025-03-09 01:57:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:21,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:21,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:21,478 INFO L87 Difference]: Start difference. First operand 670 states and 736 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:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:21,714 INFO L93 Difference]: Finished difference Result 670 states and 736 transitions. [2025-03-09 01:57:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:21,715 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:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:21,717 INFO L225 Difference]: With dead ends: 670 [2025-03-09 01:57:21,717 INFO L226 Difference]: Without dead ends: 604 [2025-03-09 01:57:21,717 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:21,718 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 524 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:21,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 473 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:57:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-09 01:57:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-03-09 01:57:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 538 states have (on average 1.245353159851301) internal successors, (670), 603 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 670 transitions. [2025-03-09 01:57:21,728 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 670 transitions. Word has length 15 [2025-03-09 01:57:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:21,729 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 670 transitions. [2025-03-09 01:57:21,729 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:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 670 transitions. [2025-03-09 01:57:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:57:21,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:21,729 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:21,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:57:21,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr392ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2114239022, now seen corresponding path program 1 times [2025-03-09 01:57:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288011468] [2025-03-09 01:57:21,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:57:21,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:57:21,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,752 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:21,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:21,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288011468] [2025-03-09 01:57:21,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288011468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:21,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:21,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:21,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622269035] [2025-03-09 01:57:21,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:21,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:21,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:21,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:21,754 INFO L87 Difference]: Start difference. First operand 604 states and 670 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:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:22,024 INFO L93 Difference]: Finished difference Result 1189 states and 1320 transitions. [2025-03-09 01:57:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:22,025 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:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:22,028 INFO L225 Difference]: With dead ends: 1189 [2025-03-09 01:57:22,029 INFO L226 Difference]: Without dead ends: 1123 [2025-03-09 01:57:22,029 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:22,030 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 523 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:22,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 993 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:57:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-03-09 01:57:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2025-03-09 01:57:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1058 states have (on average 1.1852551984877127) internal successors, (1254), 1122 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1254 transitions. [2025-03-09 01:57:22,048 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1254 transitions. Word has length 16 [2025-03-09 01:57:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:22,049 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1254 transitions. [2025-03-09 01:57:22,049 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:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1254 transitions. [2025-03-09 01:57:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:57:22,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:22,050 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:22,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:57:22,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr386ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1744568985, now seen corresponding path program 1 times [2025-03-09 01:57:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657831061] [2025-03-09 01:57:22,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:22,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:22,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:57:22,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:57:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,109 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:22,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:22,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657831061] [2025-03-09 01:57:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657831061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:22,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255145541] [2025-03-09 01:57:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:22,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:22,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:22,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:22,110 INFO L87 Difference]: Start difference. First operand 1123 states and 1254 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:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:22,519 INFO L93 Difference]: Finished difference Result 1699 states and 1894 transitions. [2025-03-09 01:57:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:22,520 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:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:22,524 INFO L225 Difference]: With dead ends: 1699 [2025-03-09 01:57:22,524 INFO L226 Difference]: Without dead ends: 1634 [2025-03-09 01:57:22,525 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:22,525 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1556 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:22,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 1440 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-09 01:57:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-09 01:57:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1570 states have (on average 1.1649681528662421) internal successors, (1829), 1633 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states 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:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1829 transitions. [2025-03-09 01:57:22,546 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1829 transitions. Word has length 22 [2025-03-09 01:57:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:22,546 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 1829 transitions. [2025-03-09 01:57:22,546 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:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1829 transitions. [2025-03-09 01:57:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:57:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:22,547 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:22,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:57:22,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr380ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:22,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -540353760, now seen corresponding path program 1 times [2025-03-09 01:57:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414522019] [2025-03-09 01:57:22,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:22,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:57:22,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:57:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,610 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:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414522019] [2025-03-09 01:57:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414522019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:57:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269079475] [2025-03-09 01:57:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:22,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:57:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:22,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:57:22,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:57:22,611 INFO L87 Difference]: Start difference. First operand 1634 states and 1829 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:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:23,072 INFO L93 Difference]: Finished difference Result 2201 states and 2459 transitions. [2025-03-09 01:57:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:57:23,072 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:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:23,077 INFO L225 Difference]: With dead ends: 2201 [2025-03-09 01:57:23,077 INFO L226 Difference]: Without dead ends: 2137 [2025-03-09 01:57:23,078 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:23,078 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 2063 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:23,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 1881 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2025-03-09 01:57:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2025-03-09 01:57:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2074 states have (on average 1.1547733847637416) internal successors, (2395), 2136 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states 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,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2395 transitions. [2025-03-09 01:57:23,103 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2395 transitions. Word has length 28 [2025-03-09 01:57:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 2395 transitions. [2025-03-09 01:57:23,103 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:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2395 transitions. [2025-03-09 01:57:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:57:23,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:23,104 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:23,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:57:23,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr374ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1764002983, now seen corresponding path program 1 times [2025-03-09 01:57:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:23,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908219313] [2025-03-09 01:57:23,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:23,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:57:23,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:57:23,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:23,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:23,155 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:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:23,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908219313] [2025-03-09 01:57:23,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908219313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:23,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:57:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633984242] [2025-03-09 01:57:23,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:57:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:23,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:57:23,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:57:23,156 INFO L87 Difference]: Start difference. First operand 2137 states and 2395 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:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:23,720 INFO L93 Difference]: Finished difference Result 3711 states and 4158 transitions. [2025-03-09 01:57:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:57:23,720 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:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:23,725 INFO L225 Difference]: With dead ends: 3711 [2025-03-09 01:57:23,725 INFO L226 Difference]: Without dead ends: 2108 [2025-03-09 01:57:23,727 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:23,729 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 2 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:23,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1228 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2025-03-09 01:57:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2108. [2025-03-09 01:57:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2046 states have (on average 1.1544477028347997) internal successors, (2362), 2107 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states 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,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2362 transitions. [2025-03-09 01:57:23,755 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2362 transitions. Word has length 34 [2025-03-09 01:57:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:23,756 INFO L471 AbstractCegarLoop]: Abstraction has 2108 states and 2362 transitions. [2025-03-09 01:57:23,757 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:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2362 transitions. [2025-03-09 01:57:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 01:57:23,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:23,759 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:23,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:57:23,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr368ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:23,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2057127437, now seen corresponding path program 1 times [2025-03-09 01:57:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:23,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392561757] [2025-03-09 01:57:23,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:23,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:57:23,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:57:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:23,826 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:23,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:23,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392561757] [2025-03-09 01:57:23,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392561757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:23,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:23,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:57:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634724807] [2025-03-09 01:57:23,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:23,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:23,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:23,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:23,828 INFO L87 Difference]: Start difference. First operand 2108 states and 2362 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:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:24,122 INFO L93 Difference]: Finished difference Result 3657 states and 4097 transitions. [2025-03-09 01:57:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:24,122 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:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:24,126 INFO L225 Difference]: With dead ends: 3657 [2025-03-09 01:57:24,126 INFO L226 Difference]: Without dead ends: 2079 [2025-03-09 01:57:24,127 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:24,127 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 2 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:24,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 829 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:57:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2025-03-09 01:57:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2025-03-09 01:57:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2018 states have (on average 1.1541129831516352) internal successors, (2329), 2078 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states 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:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2329 transitions. [2025-03-09 01:57:24,167 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2329 transitions. Word has length 38 [2025-03-09 01:57:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:24,168 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 2329 transitions. [2025-03-09 01:57:24,168 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:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2329 transitions. [2025-03-09 01:57:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 01:57:24,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:24,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:24,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:57:24,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr362ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:24,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1152864499, now seen corresponding path program 1 times [2025-03-09 01:57:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:24,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672349770] [2025-03-09 01:57:24,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:24,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:24,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:57:24,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:57:24,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:24,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:24,231 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:24,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:24,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672349770] [2025-03-09 01:57:24,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672349770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:24,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:24,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:57:24,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352336503] [2025-03-09 01:57:24,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:24,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:57:24,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:24,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:57:24,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:57:24,232 INFO L87 Difference]: Start difference. First operand 2079 states and 2329 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:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:24,643 INFO L93 Difference]: Finished difference Result 3603 states and 4036 transitions. [2025-03-09 01:57:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:57:24,643 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:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:24,647 INFO L225 Difference]: With dead ends: 3603 [2025-03-09 01:57:24,649 INFO L226 Difference]: Without dead ends: 2050 [2025-03-09 01:57:24,650 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:24,651 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 2 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:24,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1003 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-09 01:57:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2025-03-09 01:57:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1990 states have (on average 1.1537688442211056) internal successors, (2296), 2049 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states 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:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2296 transitions. [2025-03-09 01:57:24,675 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2296 transitions. Word has length 42 [2025-03-09 01:57:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:24,676 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 2296 transitions. [2025-03-09 01:57:24,676 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:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2296 transitions. [2025-03-09 01:57:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:57:24,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:24,677 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:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:57:24,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr356ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:24,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -191753561, now seen corresponding path program 1 times [2025-03-09 01:57:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240109693] [2025-03-09 01:57:24,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:24,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:57:24,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:57:24,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:24,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:24,761 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:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240109693] [2025-03-09 01:57:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240109693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:24,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:24,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:57:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591858246] [2025-03-09 01:57:24,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:57:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:24,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:57:24,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:24,762 INFO L87 Difference]: Start difference. First operand 2050 states and 2296 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:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:25,174 INFO L93 Difference]: Finished difference Result 3549 states and 3975 transitions. [2025-03-09 01:57:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:57:25,174 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:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:25,178 INFO L225 Difference]: With dead ends: 3549 [2025-03-09 01:57:25,178 INFO L226 Difference]: Without dead ends: 2021 [2025-03-09 01:57:25,179 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:25,180 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 2 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:25,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2025-03-09 01:57:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2021. [2025-03-09 01:57:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 1962 states have (on average 1.153414882772681) internal successors, (2263), 2020 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states 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:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2263 transitions. [2025-03-09 01:57:25,200 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2263 transitions. Word has length 46 [2025-03-09 01:57:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:25,200 INFO L471 AbstractCegarLoop]: Abstraction has 2021 states and 2263 transitions. [2025-03-09 01:57:25,200 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:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2263 transitions. [2025-03-09 01:57:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:57:25,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:25,200 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:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:57:25,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr350ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash -589060927, now seen corresponding path program 1 times [2025-03-09 01:57:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808044671] [2025-03-09 01:57:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:25,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:57:25,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:57:25,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:25,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:25,277 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:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808044671] [2025-03-09 01:57:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808044671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:57:25,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751316227] [2025-03-09 01:57:25,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:25,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:57:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:25,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:57:25,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:57:25,278 INFO L87 Difference]: Start difference. First operand 2021 states and 2263 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:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:25,700 INFO L93 Difference]: Finished difference Result 3495 states and 3914 transitions. [2025-03-09 01:57:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:57:25,700 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:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:25,704 INFO L225 Difference]: With dead ends: 3495 [2025-03-09 01:57:25,704 INFO L226 Difference]: Without dead ends: 1992 [2025-03-09 01:57:25,705 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:25,705 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 2 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:25,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1152 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-03-09 01:57:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992. [2025-03-09 01:57:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1934 states have (on average 1.1530506721820062) internal successors, (2230), 1991 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states 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:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2230 transitions. [2025-03-09 01:57:25,724 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2230 transitions. Word has length 50 [2025-03-09 01:57:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:25,725 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 2230 transitions. [2025-03-09 01:57:25,725 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:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2230 transitions. [2025-03-09 01:57:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 01:57:25,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:25,725 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, 1, 1, 1, 1] [2025-03-09 01:57:25,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:57:25,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr344ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:25,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1065493851, now seen corresponding path program 1 times [2025-03-09 01:57:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791006119] [2025-03-09 01:57:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:25,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 01:57:25,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:57:25,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:25,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:25,841 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:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791006119] [2025-03-09 01:57:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791006119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:57:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413371132] [2025-03-09 01:57:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:25,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:57:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:25,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:57:25,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:25,842 INFO L87 Difference]: Start difference. First operand 1992 states and 2230 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:26,262 INFO L93 Difference]: Finished difference Result 3441 states and 3853 transitions. [2025-03-09 01:57:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:26,267 INFO L225 Difference]: With dead ends: 3441 [2025-03-09 01:57:26,267 INFO L226 Difference]: Without dead ends: 1963 [2025-03-09 01:57:26,268 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:26,268 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:26,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1133 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2025-03-09 01:57:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2025-03-09 01:57:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1906 states have (on average 1.152675760755509) internal successors, (2197), 1962 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states 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,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2197 transitions. [2025-03-09 01:57:26,285 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2197 transitions. Word has length 54 [2025-03-09 01:57:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:26,285 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2197 transitions. [2025-03-09 01:57:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2197 transitions. [2025-03-09 01:57:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:57:26,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:26,285 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:26,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:57:26,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr338ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:26,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 928142453, now seen corresponding path program 1 times [2025-03-09 01:57:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207216368] [2025-03-09 01:57:26,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:26,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:57:26,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:57:26,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:26,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:26,385 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:26,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207216368] [2025-03-09 01:57:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207216368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:26,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:57:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757038634] [2025-03-09 01:57:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:26,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:57:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:26,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:57:26,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:57:26,386 INFO L87 Difference]: Start difference. First operand 1963 states and 2197 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:26,925 INFO L93 Difference]: Finished difference Result 3387 states and 3792 transitions. [2025-03-09 01:57:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:57:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-09 01:57:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:26,929 INFO L225 Difference]: With dead ends: 3387 [2025-03-09 01:57:26,929 INFO L226 Difference]: Without dead ends: 1934 [2025-03-09 01:57:26,930 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:26,930 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:26,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1289 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2025-03-09 01:57:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2025-03-09 01:57:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1878 states have (on average 1.1522896698615548) internal successors, (2164), 1933 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states 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,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2164 transitions. [2025-03-09 01:57:26,944 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2164 transitions. Word has length 58 [2025-03-09 01:57:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:26,944 INFO L471 AbstractCegarLoop]: Abstraction has 1934 states and 2164 transitions. [2025-03-09 01:57:26,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2164 transitions. [2025-03-09 01:57:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 01:57:26,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:26,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:26,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:57:26,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr332ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:26,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1591276047, now seen corresponding path program 1 times [2025-03-09 01:57:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438785849] [2025-03-09 01:57:26,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:26,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 01:57:26,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 01:57:26,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:26,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:27,047 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:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438785849] [2025-03-09 01:57:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438785849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:27,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:57:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115407971] [2025-03-09 01:57:27,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:57:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:27,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:57:27,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:27,048 INFO L87 Difference]: Start difference. First operand 1934 states and 2164 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:27,468 INFO L93 Difference]: Finished difference Result 3333 states and 3731 transitions. [2025-03-09 01:57:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:57:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:27,472 INFO L225 Difference]: With dead ends: 3333 [2025-03-09 01:57:27,472 INFO L226 Difference]: Without dead ends: 1905 [2025-03-09 01:57:27,473 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:27,473 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 2 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:27,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1095 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2025-03-09 01:57:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1905. [2025-03-09 01:57:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1850 states have (on average 1.151891891891892) internal successors, (2131), 1904 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states 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:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2131 transitions. [2025-03-09 01:57:27,484 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2131 transitions. Word has length 62 [2025-03-09 01:57:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:27,484 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2131 transitions. [2025-03-09 01:57:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2131 transitions. [2025-03-09 01:57:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:57:27,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:27,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:27,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:57:27,485 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr326ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:27,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 3849769, now seen corresponding path program 1 times [2025-03-09 01:57:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:27,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-03-09 01:57:27,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:27,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:57:27,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:57:27,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:27,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:27,604 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:27,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-03-09 01:57:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005088799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:27,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 01:57:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494555193] [2025-03-09 01:57:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:27,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:57:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:27,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:57:27,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:57:27,606 INFO L87 Difference]: Start difference. First operand 1905 states and 2131 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:28,064 INFO L93 Difference]: Finished difference Result 3279 states and 3670 transitions. [2025-03-09 01:57:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:57:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:28,068 INFO L225 Difference]: With dead ends: 3279 [2025-03-09 01:57:28,068 INFO L226 Difference]: Without dead ends: 1876 [2025-03-09 01:57:28,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:57:28,069 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 2 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:28,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1076 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-03-09 01:57:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2025-03-09 01:57:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1822 states have (on average 1.1514818880351263) internal successors, (2098), 1875 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states 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:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2098 transitions. [2025-03-09 01:57:28,080 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2098 transitions. Word has length 66 [2025-03-09 01:57:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:28,080 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 2098 transitions. [2025-03-09 01:57:28,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2098 transitions. [2025-03-09 01:57:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 01:57:28,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:28,081 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, 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:28,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:57:28,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr320ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1161590979, now seen corresponding path program 1 times [2025-03-09 01:57:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929757660] [2025-03-09 01:57:28,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:28,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 01:57:28,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 01:57:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:28,232 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:28,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929757660] [2025-03-09 01:57:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929757660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:28,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:28,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 01:57:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577923080] [2025-03-09 01:57:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:28,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:57:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:28,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:57:28,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:57:28,233 INFO L87 Difference]: Start difference. First operand 1876 states and 2098 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:28,761 INFO L93 Difference]: Finished difference Result 3225 states and 3609 transitions. [2025-03-09 01:57:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:57:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-09 01:57:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:28,765 INFO L225 Difference]: With dead ends: 3225 [2025-03-09 01:57:28,765 INFO L226 Difference]: Without dead ends: 1847 [2025-03-09 01:57:28,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:57:28,767 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:28,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1057 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-03-09 01:57:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2025-03-09 01:57:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1794 states have (on average 1.1510590858416945) internal successors, (2065), 1846 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2065 transitions. [2025-03-09 01:57:28,779 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2065 transitions. Word has length 70 [2025-03-09 01:57:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:28,779 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2065 transitions. [2025-03-09 01:57:28,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2065 transitions. [2025-03-09 01:57:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 01:57:28,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:28,781 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, 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:28,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:57:28,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr314ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:28,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1732436445, now seen corresponding path program 1 times [2025-03-09 01:57:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638675783] [2025-03-09 01:57:28,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:28,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 01:57:28,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 01:57:28,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:28,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:28,947 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:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638675783] [2025-03-09 01:57:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638675783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 01:57:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796757892] [2025-03-09 01:57:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:28,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:57:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:57:28,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:57:28,949 INFO L87 Difference]: Start difference. First operand 1847 states and 2065 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:29,625 INFO L93 Difference]: Finished difference Result 3171 states and 3548 transitions. [2025-03-09 01:57:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:57:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-09 01:57:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:29,629 INFO L225 Difference]: With dead ends: 3171 [2025-03-09 01:57:29,629 INFO L226 Difference]: Without dead ends: 1818 [2025-03-09 01:57:29,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:57:29,630 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:29,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1364 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 01:57:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2025-03-09 01:57:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1818. [2025-03-09 01:57:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1766 states have (on average 1.1506228765571913) internal successors, (2032), 1817 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states 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:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2032 transitions. [2025-03-09 01:57:29,642 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2032 transitions. Word has length 74 [2025-03-09 01:57:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:29,642 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2032 transitions. [2025-03-09 01:57:29,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2032 transitions. [2025-03-09 01:57:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 01:57:29,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:29,642 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, 1, 1, 1, 1, 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:29,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:57:29,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr308ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:29,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -548226697, now seen corresponding path program 1 times [2025-03-09 01:57:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380494283] [2025-03-09 01:57:29,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 01:57:29,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 01:57:29,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:29,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:29,810 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:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380494283] [2025-03-09 01:57:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380494283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:29,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:29,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 01:57:29,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091286523] [2025-03-09 01:57:29,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:57:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:29,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:57:29,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:29,811 INFO L87 Difference]: Start difference. First operand 1818 states and 2032 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:30,572 INFO L93 Difference]: Finished difference Result 3117 states and 3487 transitions. [2025-03-09 01:57:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:57:30,572 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-09 01:57:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:30,575 INFO L225 Difference]: With dead ends: 3117 [2025-03-09 01:57:30,575 INFO L226 Difference]: Without dead ends: 1789 [2025-03-09 01:57:30,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:30,577 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:30,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1659 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 01:57:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2025-03-09 01:57:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2025-03-09 01:57:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1738 states have (on average 1.1501726121979285) internal successors, (1999), 1788 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states 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:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 1999 transitions. [2025-03-09 01:57:30,590 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 1999 transitions. Word has length 78 [2025-03-09 01:57:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 1999 transitions. [2025-03-09 01:57:30,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 1999 transitions. [2025-03-09 01:57:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 01:57:30,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:30,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:57:30,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr302ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:30,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:30,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1777287279, now seen corresponding path program 1 times [2025-03-09 01:57:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:30,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784867683] [2025-03-09 01:57:30,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:30,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:30,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 01:57:30,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 01:57:30,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:30,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:30,777 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:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784867683] [2025-03-09 01:57:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784867683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:30,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:30,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 01:57:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522834366] [2025-03-09 01:57:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:57:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:30,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:57:30,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:57:30,779 INFO L87 Difference]: Start difference. First operand 1789 states and 1999 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:31,448 INFO L93 Difference]: Finished difference Result 3063 states and 3426 transitions. [2025-03-09 01:57:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:57:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-09 01:57:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:31,455 INFO L225 Difference]: With dead ends: 3063 [2025-03-09 01:57:31,455 INFO L226 Difference]: Without dead ends: 1760 [2025-03-09 01:57:31,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:57:31,456 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 2 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:31,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1314 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:57:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-09 01:57:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-09 01:57:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1710 states have (on average 1.1497076023391812) internal successors, (1966), 1759 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states 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:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 1966 transitions. [2025-03-09 01:57:31,467 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 1966 transitions. Word has length 82 [2025-03-09 01:57:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:31,467 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 1966 transitions. [2025-03-09 01:57:31,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 1966 transitions. [2025-03-09 01:57:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 01:57:31,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:31,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:57:31,468 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr296ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:31,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 331461675, now seen corresponding path program 1 times [2025-03-09 01:57:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-09 01:57:31,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:31,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 01:57:31,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 01:57:31,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:31,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:31,650 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:31,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:31,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-09 01:57:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933400981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-09 01:57:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098338359] [2025-03-09 01:57:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:31,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:57:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:31,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:57:31,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:57:31,652 INFO L87 Difference]: Start difference. First operand 1760 states and 1966 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:32,149 INFO L93 Difference]: Finished difference Result 3009 states and 3365 transitions. [2025-03-09 01:57:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:57:32,149 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-09 01:57:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:32,152 INFO L225 Difference]: With dead ends: 3009 [2025-03-09 01:57:32,152 INFO L226 Difference]: Without dead ends: 1731 [2025-03-09 01:57:32,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:57:32,153 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 2 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:32,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1135 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2025-03-09 01:57:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2025-03-09 01:57:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1682 states have (on average 1.1492271105826397) internal successors, (1933), 1730 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states 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:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 1933 transitions. [2025-03-09 01:57:32,162 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 1933 transitions. Word has length 86 [2025-03-09 01:57:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:32,163 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 1933 transitions. [2025-03-09 01:57:32,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 1933 transitions. [2025-03-09 01:57:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 01:57:32,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:32,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:57:32,164 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr290ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:32,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1337305275, now seen corresponding path program 1 times [2025-03-09 01:57:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213459056] [2025-03-09 01:57:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:32,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 01:57:32,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 01:57:32,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:32,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:32,371 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:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213459056] [2025-03-09 01:57:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213459056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:32,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-09 01:57:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59976280] [2025-03-09 01:57:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:32,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:57:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:32,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:57:32,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:57:32,373 INFO L87 Difference]: Start difference. First operand 1731 states and 1933 transitions. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 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:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,010 INFO L93 Difference]: Finished difference Result 2955 states and 3304 transitions. [2025-03-09 01:57:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:57:33,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 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) Word has length 90 [2025-03-09 01:57:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,013 INFO L225 Difference]: With dead ends: 2955 [2025-03-09 01:57:33,013 INFO L226 Difference]: Without dead ends: 1702 [2025-03-09 01:57:33,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:57:33,014 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 2 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:57:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-03-09 01:57:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2025-03-09 01:57:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1654 states have (on average 1.1487303506650544) internal successors, (1900), 1701 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states 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,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 1900 transitions. [2025-03-09 01:57:33,024 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 1900 transitions. Word has length 90 [2025-03-09 01:57:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,024 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 1900 transitions. [2025-03-09 01:57:33,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 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:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 1900 transitions. [2025-03-09 01:57:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 01:57:33,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:57:33,024 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr284ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1020303137, now seen corresponding path program 1 times [2025-03-09 01:57:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306956149] [2025-03-09 01:57:33,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 01:57:33,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 01:57:33,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,231 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:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306956149] [2025-03-09 01:57:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306956149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-09 01:57:33,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896790788] [2025-03-09 01:57:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:57:33,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:57:33,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:57:33,233 INFO L87 Difference]: Start difference. First operand 1702 states and 1900 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 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:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,639 INFO L93 Difference]: Finished difference Result 2901 states and 3243 transitions. [2025-03-09 01:57:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:57:33,639 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 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) Word has length 94 [2025-03-09 01:57:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,642 INFO L225 Difference]: With dead ends: 2901 [2025-03-09 01:57:33,642 INFO L226 Difference]: Without dead ends: 1673 [2025-03-09 01:57:33,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 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:33,643 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 2 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 943 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-03-09 01:57:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-03-09 01:57:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1626 states have (on average 1.1482164821648218) internal successors, (1867), 1672 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states 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,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1867 transitions. [2025-03-09 01:57:33,653 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1867 transitions. Word has length 94 [2025-03-09 01:57:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,653 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 1867 transitions. [2025-03-09 01:57:33,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 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:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1867 transitions. [2025-03-09 01:57:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 01:57:33,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:57:33,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr278ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:33,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash -745166599, now seen corresponding path program 1 times [2025-03-09 01:57:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712637897] [2025-03-09 01:57:33,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 01:57:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 01:57:33,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712637897] [2025-03-09 01:57:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712637897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-09 01:57:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281732832] [2025-03-09 01:57:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:57:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:57:33,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:57:33,891 INFO L87 Difference]: Start difference. First operand 1673 states and 1867 transitions. Second operand has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 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:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:34,417 INFO L93 Difference]: Finished difference Result 2847 states and 3182 transitions. [2025-03-09 01:57:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:57:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 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) Word has length 98 [2025-03-09 01:57:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:34,419 INFO L225 Difference]: With dead ends: 2847 [2025-03-09 01:57:34,420 INFO L226 Difference]: Without dead ends: 1644 [2025-03-09 01:57:34,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:57:34,421 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:34,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1214 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-09 01:57:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2025-03-09 01:57:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1598 states have (on average 1.1476846057571966) internal successors, (1834), 1643 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states 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:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 1834 transitions. [2025-03-09 01:57:34,430 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 1834 transitions. Word has length 98 [2025-03-09 01:57:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:34,430 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 1834 transitions. [2025-03-09 01:57:34,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 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:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1834 transitions. [2025-03-09 01:57:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 01:57:34,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:34,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:57:34,431 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr272ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:34,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash -935209069, now seen corresponding path program 1 times [2025-03-09 01:57:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907042643] [2025-03-09 01:57:34,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:34,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 01:57:34,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 01:57:34,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:34,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:34,684 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:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907042643] [2025-03-09 01:57:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907042643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-09 01:57:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713793459] [2025-03-09 01:57:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:57:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:34,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:57:34,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:57:34,687 INFO L87 Difference]: Start difference. First operand 1644 states and 1834 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:35,229 INFO L93 Difference]: Finished difference Result 2793 states and 3121 transitions. [2025-03-09 01:57:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:57:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-09 01:57:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:35,232 INFO L225 Difference]: With dead ends: 2793 [2025-03-09 01:57:35,232 INFO L226 Difference]: Without dead ends: 1615 [2025-03-09 01:57:35,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:57:35,233 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 2 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:35,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1047 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-03-09 01:57:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-03-09 01:57:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1570 states have (on average 1.1471337579617835) internal successors, (1801), 1614 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states 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:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1801 transitions. [2025-03-09 01:57:35,242 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1801 transitions. Word has length 102 [2025-03-09 01:57:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:35,242 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 1801 transitions. [2025-03-09 01:57:35,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1801 transitions. [2025-03-09 01:57:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 01:57:35,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:35,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:57:35,243 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr266ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash 395883693, now seen corresponding path program 1 times [2025-03-09 01:57:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077046903] [2025-03-09 01:57:35,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:35,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 01:57:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 01:57:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:35,548 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:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077046903] [2025-03-09 01:57:35,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077046903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:35,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:35,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-09 01:57:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349322424] [2025-03-09 01:57:35,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:35,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:57:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:35,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:57:35,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:57:35,549 INFO L87 Difference]: Start difference. First operand 1615 states and 1801 transitions. Second operand has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:36,151 INFO L93 Difference]: Finished difference Result 2739 states and 3060 transitions. [2025-03-09 01:57:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:57:36,151 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-09 01:57:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:36,153 INFO L225 Difference]: With dead ends: 2739 [2025-03-09 01:57:36,153 INFO L226 Difference]: Without dead ends: 1586 [2025-03-09 01:57:36,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:57:36,154 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:36,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1303 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:57:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2025-03-09 01:57:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2025-03-09 01:57:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1542 states have (on average 1.146562905317769) internal successors, (1768), 1585 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1768 transitions. [2025-03-09 01:57:36,163 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1768 transitions. Word has length 106 [2025-03-09 01:57:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:36,164 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 1768 transitions. [2025-03-09 01:57:36,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1768 transitions. [2025-03-09 01:57:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 01:57:36,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:36,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:57:36,164 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr260ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash -140574649, now seen corresponding path program 1 times [2025-03-09 01:57:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554592328] [2025-03-09 01:57:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:36,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 01:57:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 01:57:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:36,500 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:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554592328] [2025-03-09 01:57:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554592328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-09 01:57:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351618737] [2025-03-09 01:57:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:36,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:57:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:36,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:57:36,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:57:36,502 INFO L87 Difference]: Start difference. First operand 1586 states and 1768 transitions. Second operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:37,003 INFO L93 Difference]: Finished difference Result 2685 states and 2999 transitions. [2025-03-09 01:57:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:57:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-09 01:57:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:37,006 INFO L225 Difference]: With dead ends: 2685 [2025-03-09 01:57:37,006 INFO L226 Difference]: Without dead ends: 1557 [2025-03-09 01:57:37,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:57:37,007 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:37,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1003 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-09 01:57:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2025-03-09 01:57:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1514 states have (on average 1.1459709379128138) internal successors, (1735), 1556 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states 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:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1735 transitions. [2025-03-09 01:57:37,015 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1735 transitions. Word has length 110 [2025-03-09 01:57:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:37,015 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1735 transitions. [2025-03-09 01:57:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1735 transitions. [2025-03-09 01:57:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 01:57:37,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:37,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:57:37,016 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr254ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1913030047, now seen corresponding path program 1 times [2025-03-09 01:57:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297466777] [2025-03-09 01:57:37,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 01:57:37,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 01:57:37,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:37,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:37,302 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:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297466777] [2025-03-09 01:57:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297466777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:37,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-09 01:57:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489506962] [2025-03-09 01:57:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:37,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:57:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:37,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:57:37,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:57:37,304 INFO L87 Difference]: Start difference. First operand 1557 states and 1735 transitions. Second operand has 25 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:37,924 INFO L93 Difference]: Finished difference Result 2631 states and 2938 transitions. [2025-03-09 01:57:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:57:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 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:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:37,926 INFO L225 Difference]: With dead ends: 2631 [2025-03-09 01:57:37,927 INFO L226 Difference]: Without dead ends: 1528 [2025-03-09 01:57:37,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:57:37,927 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 2 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:37,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1114 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:57:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-03-09 01:57:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2025-03-09 01:57:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1486 states have (on average 1.14535666218035) internal successors, (1702), 1527 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states 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:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1702 transitions. [2025-03-09 01:57:37,936 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1702 transitions. Word has length 114 [2025-03-09 01:57:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:37,936 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 1702 transitions. [2025-03-09 01:57:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1702 transitions. [2025-03-09 01:57:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 01:57:37,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:37,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:57:37,937 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr248ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 535618299, now seen corresponding path program 1 times [2025-03-09 01:57:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:37,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51713239] [2025-03-09 01:57:37,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:37,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 01:57:37,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 01:57:37,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:37,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:38,236 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:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51713239] [2025-03-09 01:57:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51713239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-09 01:57:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281601871] [2025-03-09 01:57:38,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:38,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:57:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:57:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:57:38,237 INFO L87 Difference]: Start difference. First operand 1528 states and 1702 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:38,819 INFO L93 Difference]: Finished difference Result 2577 states and 2877 transitions. [2025-03-09 01:57:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:57:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-09 01:57:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:38,821 INFO L225 Difference]: With dead ends: 2577 [2025-03-09 01:57:38,821 INFO L226 Difference]: Without dead ends: 1499 [2025-03-09 01:57:38,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:57:38,822 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 2 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:38,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1219 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:57:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-09 01:57:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2025-03-09 01:57:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1458 states have (on average 1.1447187928669411) internal successors, (1669), 1498 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states 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:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1669 transitions. [2025-03-09 01:57:38,831 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1669 transitions. Word has length 118 [2025-03-09 01:57:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1669 transitions. [2025-03-09 01:57:38,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1669 transitions. [2025-03-09 01:57:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 01:57:38,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:38,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 01:57:38,832 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr242ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:38,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1113455125, now seen corresponding path program 1 times [2025-03-09 01:57:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655955433] [2025-03-09 01:57:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 01:57:38,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 01:57:38,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:39,136 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:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655955433] [2025-03-09 01:57:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655955433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-09 01:57:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273844886] [2025-03-09 01:57:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:39,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 01:57:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:39,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 01:57:39,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2025-03-09 01:57:39,137 INFO L87 Difference]: Start difference. First operand 1499 states and 1669 transitions. Second operand has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:39,514 INFO L93 Difference]: Finished difference Result 2523 states and 2816 transitions. [2025-03-09 01:57:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:57:39,517 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-09 01:57:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:39,519 INFO L225 Difference]: With dead ends: 2523 [2025-03-09 01:57:39,519 INFO L226 Difference]: Without dead ends: 1470 [2025-03-09 01:57:39,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2025-03-09 01:57:39,521 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 2 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:39,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 810 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2025-03-09 01:57:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1470. [2025-03-09 01:57:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1430 states have (on average 1.1440559440559441) internal successors, (1636), 1469 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states 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:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1636 transitions. [2025-03-09 01:57:39,530 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1636 transitions. Word has length 122 [2025-03-09 01:57:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:39,530 INFO L471 AbstractCegarLoop]: Abstraction has 1470 states and 1636 transitions. [2025-03-09 01:57:39,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1636 transitions. [2025-03-09 01:57:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-09 01:57:39,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:39,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 01:57:39,531 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr236ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:39,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 164724655, now seen corresponding path program 1 times [2025-03-09 01:57:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623103212] [2025-03-09 01:57:39,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-09 01:57:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-09 01:57:39,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:39,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:39,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623103212] [2025-03-09 01:57:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623103212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:39,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-09 01:57:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112070654] [2025-03-09 01:57:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:39,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:57:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:39,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:57:39,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:57:39,839 INFO L87 Difference]: Start difference. First operand 1470 states and 1636 transitions. Second operand has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:40,362 INFO L93 Difference]: Finished difference Result 2469 states and 2755 transitions. [2025-03-09 01:57:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 01:57:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-09 01:57:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:40,364 INFO L225 Difference]: With dead ends: 2469 [2025-03-09 01:57:40,364 INFO L226 Difference]: Without dead ends: 1441 [2025-03-09 01:57:40,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:57:40,365 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 2 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:40,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1039 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-03-09 01:57:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2025-03-09 01:57:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1402 states have (on average 1.1433666191155492) internal successors, (1603), 1440 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1603 transitions. [2025-03-09 01:57:40,374 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1603 transitions. Word has length 126 [2025-03-09 01:57:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:40,374 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 1603 transitions. [2025-03-09 01:57:40,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1603 transitions. [2025-03-09 01:57:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 01:57:40,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:40,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 01:57:40,375 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr230ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:40,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 980169673, now seen corresponding path program 1 times [2025-03-09 01:57:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070150777] [2025-03-09 01:57:40,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:40,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-09 01:57:40,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 01:57:40,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:40,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:40,766 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:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:40,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070150777] [2025-03-09 01:57:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070150777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-09 01:57:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774931896] [2025-03-09 01:57:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:40,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:57:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:40,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:57:40,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:57:40,769 INFO L87 Difference]: Start difference. First operand 1441 states and 1603 transitions. Second operand has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 29 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:41,552 INFO L93 Difference]: Finished difference Result 2415 states and 2694 transitions. [2025-03-09 01:57:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 01:57:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 29 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-09 01:57:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:41,556 INFO L225 Difference]: With dead ends: 2415 [2025-03-09 01:57:41,556 INFO L226 Difference]: Without dead ends: 1412 [2025-03-09 01:57:41,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:57:41,557 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 2 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:41,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1135 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 01:57:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-03-09 01:57:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2025-03-09 01:57:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1374 states have (on average 1.1426491994177583) internal successors, (1570), 1411 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states 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:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1570 transitions. [2025-03-09 01:57:41,567 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1570 transitions. Word has length 130 [2025-03-09 01:57:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:41,567 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 1570 transitions. [2025-03-09 01:57:41,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 29 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1570 transitions. [2025-03-09 01:57:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-09 01:57:41,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:41,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 01:57:41,568 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr224ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2012403299, now seen corresponding path program 1 times [2025-03-09 01:57:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861458846] [2025-03-09 01:57:41,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:41,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-09 01:57:41,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-09 01:57:41,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:41,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:41,960 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:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861458846] [2025-03-09 01:57:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861458846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:41,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2025-03-09 01:57:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104416843] [2025-03-09 01:57:41,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:41,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:57:41,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:41,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:57:41,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:57:41,962 INFO L87 Difference]: Start difference. First operand 1412 states and 1570 transitions. Second operand has 30 states, 30 states have (on average 4.466666666666667) internal successors, (134), 30 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:42,384 INFO L93 Difference]: Finished difference Result 2361 states and 2633 transitions. [2025-03-09 01:57:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:57:42,384 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.466666666666667) internal successors, (134), 30 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-09 01:57:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:42,386 INFO L225 Difference]: With dead ends: 2361 [2025-03-09 01:57:42,386 INFO L226 Difference]: Without dead ends: 1383 [2025-03-09 01:57:42,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:57:42,387 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 2 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:42,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 871 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-09 01:57:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-03-09 01:57:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1346 states have (on average 1.1419019316493313) internal successors, (1537), 1382 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states 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:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1537 transitions. [2025-03-09 01:57:42,393 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1537 transitions. Word has length 134 [2025-03-09 01:57:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:42,394 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1537 transitions. [2025-03-09 01:57:42,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.466666666666667) internal successors, (134), 30 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1537 transitions. [2025-03-09 01:57:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-09 01:57:42,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:42,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 01:57:42,394 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:42,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1976182653, now seen corresponding path program 1 times [2025-03-09 01:57:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473941219] [2025-03-09 01:57:42,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:42,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 01:57:42,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 01:57:42,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:42,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:42,819 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:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473941219] [2025-03-09 01:57:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473941219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-03-09 01:57:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061753766] [2025-03-09 01:57:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 01:57:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:42,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 01:57:42,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2025-03-09 01:57:42,821 INFO L87 Difference]: Start difference. First operand 1383 states and 1537 transitions. Second operand has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:43,446 INFO L93 Difference]: Finished difference Result 2307 states and 2572 transitions. [2025-03-09 01:57:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 01:57:43,447 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-09 01:57:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:43,449 INFO L225 Difference]: With dead ends: 2307 [2025-03-09 01:57:43,449 INFO L226 Difference]: Without dead ends: 1354 [2025-03-09 01:57:43,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2025-03-09 01:57:43,450 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:43,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 964 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:57:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-09 01:57:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2025-03-09 01:57:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1318 states have (on average 1.1411229135053111) internal successors, (1504), 1353 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states 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:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1504 transitions. [2025-03-09 01:57:43,457 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1504 transitions. Word has length 138 [2025-03-09 01:57:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:43,458 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1504 transitions. [2025-03-09 01:57:43,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1504 transitions. [2025-03-09 01:57:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-09 01:57:43,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:43,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 01:57:43,459 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:43,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 653715223, now seen corresponding path program 1 times [2025-03-09 01:57:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:43,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080409679] [2025-03-09 01:57:43,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:43,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-09 01:57:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-09 01:57:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:43,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:43,835 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:43,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080409679] [2025-03-09 01:57:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080409679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:43,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:43,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-09 01:57:43,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709491126] [2025-03-09 01:57:43,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:43,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:57:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:43,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:57:43,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:57:43,836 INFO L87 Difference]: Start difference. First operand 1354 states and 1504 transitions. Second operand has 32 states, 32 states have (on average 4.4375) internal successors, (142), 32 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:44,207 INFO L93 Difference]: Finished difference Result 2253 states and 2511 transitions. [2025-03-09 01:57:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 01:57:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.4375) internal successors, (142), 32 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-09 01:57:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:44,209 INFO L225 Difference]: With dead ends: 2253 [2025-03-09 01:57:44,209 INFO L226 Difference]: Without dead ends: 1325 [2025-03-09 01:57:44,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:57:44,211 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 2 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:44,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 715 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-09 01:57:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2025-03-09 01:57:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1290 states have (on average 1.1403100775193797) internal successors, (1471), 1324 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states 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:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1471 transitions. [2025-03-09 01:57:44,218 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1471 transitions. Word has length 142 [2025-03-09 01:57:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:44,219 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1471 transitions. [2025-03-09 01:57:44,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.4375) internal successors, (142), 32 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1471 transitions. [2025-03-09 01:57:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-09 01:57:44,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:44,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 01:57:44,220 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -300034767, now seen corresponding path program 1 times [2025-03-09 01:57:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477167018] [2025-03-09 01:57:44,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:44,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-09 01:57:44,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-09 01:57:44,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:44,659 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:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477167018] [2025-03-09 01:57:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477167018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2025-03-09 01:57:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641126047] [2025-03-09 01:57:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 01:57:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:44,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 01:57:44,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 01:57:44,661 INFO L87 Difference]: Start difference. First operand 1325 states and 1471 transitions. Second operand has 33 states, 33 states have (on average 4.424242424242424) internal successors, (146), 33 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:45,056 INFO L93 Difference]: Finished difference Result 2199 states and 2450 transitions. [2025-03-09 01:57:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 01:57:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.424242424242424) internal successors, (146), 33 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-09 01:57:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:45,058 INFO L225 Difference]: With dead ends: 2199 [2025-03-09 01:57:45,058 INFO L226 Difference]: Without dead ends: 1296 [2025-03-09 01:57:45,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 01:57:45,059 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 2 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:45,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 696 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-03-09 01:57:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-03-09 01:57:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1262 states have (on average 1.13946117274168) internal successors, (1438), 1295 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states 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:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1438 transitions. [2025-03-09 01:57:45,067 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1438 transitions. Word has length 146 [2025-03-09 01:57:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:45,067 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1438 transitions. [2025-03-09 01:57:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.424242424242424) internal successors, (146), 33 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1438 transitions. [2025-03-09 01:57:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-09 01:57:45,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:45,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 01:57:45,068 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -847007285, now seen corresponding path program 1 times [2025-03-09 01:57:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893629580] [2025-03-09 01:57:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:45,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-09 01:57:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 01:57:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893629580] [2025-03-09 01:57:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893629580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-03-09 01:57:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384765111] [2025-03-09 01:57:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 01:57:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:45,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 01:57:45,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:57:45,516 INFO L87 Difference]: Start difference. First operand 1296 states and 1438 transitions. Second operand has 34 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 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:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:46,006 INFO L93 Difference]: Finished difference Result 2145 states and 2389 transitions. [2025-03-09 01:57:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 01:57:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 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) Word has length 150 [2025-03-09 01:57:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:46,008 INFO L225 Difference]: With dead ends: 2145 [2025-03-09 01:57:46,008 INFO L226 Difference]: Without dead ends: 1267 [2025-03-09 01:57:46,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:57:46,010 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 2 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:46,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 889 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-03-09 01:57:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1267. [2025-03-09 01:57:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1234 states have (on average 1.1385737439222041) internal successors, (1405), 1266 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1405 transitions. [2025-03-09 01:57:46,016 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1405 transitions. Word has length 150 [2025-03-09 01:57:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1405 transitions. [2025-03-09 01:57:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 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:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1405 transitions. [2025-03-09 01:57:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-09 01:57:46,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:46,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-09 01:57:46,018 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:46,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1760740123, now seen corresponding path program 1 times [2025-03-09 01:57:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076887169] [2025-03-09 01:57:46,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:46,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-09 01:57:46,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-09 01:57:46,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:46,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076887169] [2025-03-09 01:57:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076887169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2025-03-09 01:57:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039034642] [2025-03-09 01:57:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:46,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:57:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:46,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:57:46,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:57:46,523 INFO L87 Difference]: Start difference. First operand 1267 states and 1405 transitions. Second operand has 35 states, 35 states have (on average 4.4) internal successors, (154), 35 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:47,033 INFO L93 Difference]: Finished difference Result 2091 states and 2328 transitions. [2025-03-09 01:57:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:57:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.4) internal successors, (154), 35 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-09 01:57:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:47,035 INFO L225 Difference]: With dead ends: 2091 [2025-03-09 01:57:47,035 INFO L226 Difference]: Without dead ends: 1238 [2025-03-09 01:57:47,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:57:47,037 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 2 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:47,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 864 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2025-03-09 01:57:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2025-03-09 01:57:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1206 states have (on average 1.1376451077943615) internal successors, (1372), 1237 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states 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:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1372 transitions. [2025-03-09 01:57:47,042 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1372 transitions. Word has length 154 [2025-03-09 01:57:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:47,043 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1372 transitions. [2025-03-09 01:57:47,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.4) internal successors, (154), 35 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1372 transitions. [2025-03-09 01:57:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-09 01:57:47,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:47,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-09 01:57:47,044 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:47,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 473904767, now seen corresponding path program 1 times [2025-03-09 01:57:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451025657] [2025-03-09 01:57:47,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:47,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-09 01:57:47,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-09 01:57:47,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:47,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:47,532 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:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451025657] [2025-03-09 01:57:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451025657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:47,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2025-03-09 01:57:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19535537] [2025-03-09 01:57:47,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:57:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:47,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:57:47,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:57:47,534 INFO L87 Difference]: Start difference. First operand 1238 states and 1372 transitions. Second operand has 36 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:48,073 INFO L93 Difference]: Finished difference Result 2037 states and 2267 transitions. [2025-03-09 01:57:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:57:48,073 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-03-09 01:57:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:48,075 INFO L225 Difference]: With dead ends: 2037 [2025-03-09 01:57:48,075 INFO L226 Difference]: Without dead ends: 1209 [2025-03-09 01:57:48,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:57:48,076 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:48,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 939 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-09 01:57:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2025-03-09 01:57:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1178 states have (on average 1.1366723259762308) internal successors, (1339), 1208 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states 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:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1339 transitions. [2025-03-09 01:57:48,083 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1339 transitions. Word has length 158 [2025-03-09 01:57:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:48,083 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1339 transitions. [2025-03-09 01:57:48,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1339 transitions. [2025-03-09 01:57:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-09 01:57:48,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:48,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-09 01:57:48,084 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1581145753, now seen corresponding path program 1 times [2025-03-09 01:57:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333018016] [2025-03-09 01:57:48,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-09 01:57:48,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 01:57:48,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:48,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:48,546 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:48,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:48,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333018016] [2025-03-09 01:57:48,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333018016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:48,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:48,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2025-03-09 01:57:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420005443] [2025-03-09 01:57:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:48,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 01:57:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:48,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 01:57:48,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:57:48,548 INFO L87 Difference]: Start difference. First operand 1209 states and 1339 transitions. Second operand has 37 states, 37 states have (on average 4.378378378378378) internal successors, (162), 37 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:48,987 INFO L93 Difference]: Finished difference Result 1983 states and 2206 transitions. [2025-03-09 01:57:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 01:57:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.378378378378378) internal successors, (162), 37 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-09 01:57:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:48,989 INFO L225 Difference]: With dead ends: 1983 [2025-03-09 01:57:48,989 INFO L226 Difference]: Without dead ends: 1180 [2025-03-09 01:57:48,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:57:48,990 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 2 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:48,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 717 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-09 01:57:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2025-03-09 01:57:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1150 states have (on average 1.1356521739130434) internal successors, (1306), 1179 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states 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:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1306 transitions. [2025-03-09 01:57:48,996 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1306 transitions. Word has length 162 [2025-03-09 01:57:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:48,996 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1306 transitions. [2025-03-09 01:57:48,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.378378378378378) internal successors, (162), 37 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1306 transitions. [2025-03-09 01:57:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-09 01:57:48,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:48,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-09 01:57:48,997 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1110477517, now seen corresponding path program 1 times [2025-03-09 01:57:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611004790] [2025-03-09 01:57:48,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:49,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 01:57:49,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 01:57:49,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:49,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:49,485 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:49,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:49,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611004790] [2025-03-09 01:57:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611004790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:49,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-03-09 01:57:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050850563] [2025-03-09 01:57:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-09 01:57:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:49,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-09 01:57:49,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 01:57:49,486 INFO L87 Difference]: Start difference. First operand 1180 states and 1306 transitions. Second operand has 38 states, 38 states have (on average 4.368421052631579) internal successors, (166), 38 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:49,892 INFO L93 Difference]: Finished difference Result 1929 states and 2145 transitions. [2025-03-09 01:57:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-09 01:57:49,893 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.368421052631579) internal successors, (166), 38 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-09 01:57:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:49,894 INFO L225 Difference]: With dead ends: 1929 [2025-03-09 01:57:49,894 INFO L226 Difference]: Without dead ends: 1151 [2025-03-09 01:57:49,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 01:57:49,896 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 2 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:49,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 695 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-03-09 01:57:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2025-03-09 01:57:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1122 states have (on average 1.1345811051693404) internal successors, (1273), 1150 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states 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:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1273 transitions. [2025-03-09 01:57:49,913 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1273 transitions. Word has length 166 [2025-03-09 01:57:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1273 transitions. [2025-03-09 01:57:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.368421052631579) internal successors, (166), 38 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1273 transitions. [2025-03-09 01:57:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-09 01:57:49,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:49,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-09 01:57:49,914 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 727136845, now seen corresponding path program 1 times [2025-03-09 01:57:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699079160] [2025-03-09 01:57:49,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-09 01:57:49,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-09 01:57:49,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:49,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:50,437 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:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699079160] [2025-03-09 01:57:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699079160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2025-03-09 01:57:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012321782] [2025-03-09 01:57:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-09 01:57:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-09 01:57:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 01:57:50,439 INFO L87 Difference]: Start difference. First operand 1151 states and 1273 transitions. Second operand has 39 states, 39 states have (on average 4.358974358974359) internal successors, (170), 39 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:50,868 INFO L93 Difference]: Finished difference Result 1875 states and 2084 transitions. [2025-03-09 01:57:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-09 01:57:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.358974358974359) internal successors, (170), 39 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-09 01:57:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:50,870 INFO L225 Difference]: With dead ends: 1875 [2025-03-09 01:57:50,870 INFO L226 Difference]: Without dead ends: 1122 [2025-03-09 01:57:50,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 01:57:50,871 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:50,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-09 01:57:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-03-09 01:57:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1094 states have (on average 1.13345521023766) internal successors, (1240), 1121 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1240 transitions. [2025-03-09 01:57:50,882 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1240 transitions. Word has length 170 [2025-03-09 01:57:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:50,882 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1240 transitions. [2025-03-09 01:57:50,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.358974358974359) internal successors, (170), 39 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1240 transitions. [2025-03-09 01:57:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-09 01:57:50,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:50,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-09 01:57:50,883 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:50,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:50,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1457155559, now seen corresponding path program 1 times [2025-03-09 01:57:50,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:50,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776746134] [2025-03-09 01:57:50,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:50,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-09 01:57:50,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-09 01:57:50,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:50,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:51,463 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:51,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:51,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776746134] [2025-03-09 01:57:51,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776746134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:51,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:51,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2025-03-09 01:57:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40524187] [2025-03-09 01:57:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:51,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:57:51,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:51,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:57:51,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:57:51,465 INFO L87 Difference]: Start difference. First operand 1122 states and 1240 transitions. Second operand has 40 states, 40 states have (on average 4.35) internal successors, (174), 40 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:51,985 INFO L93 Difference]: Finished difference Result 1821 states and 2023 transitions. [2025-03-09 01:57:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 01:57:51,986 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.35) internal successors, (174), 40 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-03-09 01:57:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:51,987 INFO L225 Difference]: With dead ends: 1821 [2025-03-09 01:57:51,987 INFO L226 Difference]: Without dead ends: 1093 [2025-03-09 01:57:51,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 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:51,988 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:51,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 827 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:57:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2025-03-09 01:57:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2025-03-09 01:57:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1066 states have (on average 1.1322701688555348) internal successors, (1207), 1092 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states 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:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1207 transitions. [2025-03-09 01:57:51,993 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1207 transitions. Word has length 174 [2025-03-09 01:57:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1207 transitions. [2025-03-09 01:57:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.35) internal successors, (174), 40 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1207 transitions. [2025-03-09 01:57:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-09 01:57:51,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:51,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-09 01:57:51,994 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -537014271, now seen corresponding path program 1 times [2025-03-09 01:57:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658250324] [2025-03-09 01:57:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:51,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-09 01:57:52,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-09 01:57:52,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:52,607 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:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658250324] [2025-03-09 01:57:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658250324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:52,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2025-03-09 01:57:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40476394] [2025-03-09 01:57:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-09 01:57:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-09 01:57:52,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 01:57:52,609 INFO L87 Difference]: Start difference. First operand 1093 states and 1207 transitions. Second operand has 41 states, 41 states have (on average 4.341463414634147) internal successors, (178), 41 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:53,052 INFO L93 Difference]: Finished difference Result 1767 states and 1962 transitions. [2025-03-09 01:57:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-09 01:57:53,053 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.341463414634147) internal successors, (178), 41 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-09 01:57:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:53,054 INFO L225 Difference]: With dead ends: 1767 [2025-03-09 01:57:53,054 INFO L226 Difference]: Without dead ends: 1064 [2025-03-09 01:57:53,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 01:57:53,055 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:53,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 629 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-09 01:57:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2025-03-09 01:57:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1038 states have (on average 1.1310211946050097) internal successors, (1174), 1063 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states 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:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1174 transitions. [2025-03-09 01:57:53,060 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1174 transitions. Word has length 178 [2025-03-09 01:57:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:53,060 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1174 transitions. [2025-03-09 01:57:53,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.341463414634147) internal successors, (178), 41 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1174 transitions. [2025-03-09 01:57:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-09 01:57:53,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:53,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-09 01:57:53,061 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2046418789, now seen corresponding path program 1 times [2025-03-09 01:57:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822887898] [2025-03-09 01:57:53,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:53,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-09 01:57:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-09 01:57:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:53,680 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:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822887898] [2025-03-09 01:57:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822887898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:53,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2025-03-09 01:57:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892023839] [2025-03-09 01:57:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-09 01:57:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-09 01:57:53,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 01:57:53,681 INFO L87 Difference]: Start difference. First operand 1064 states and 1174 transitions. Second operand has 42 states, 42 states have (on average 4.333333333333333) internal successors, (182), 42 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:54,049 INFO L93 Difference]: Finished difference Result 1713 states and 1901 transitions. [2025-03-09 01:57:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-09 01:57:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.333333333333333) internal successors, (182), 42 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-09 01:57:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:54,051 INFO L225 Difference]: With dead ends: 1713 [2025-03-09 01:57:54,051 INFO L226 Difference]: Without dead ends: 1035 [2025-03-09 01:57:54,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 01:57:54,052 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:54,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 525 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:57:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-09 01:57:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2025-03-09 01:57:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1010 states have (on average 1.1297029702970296) internal successors, (1141), 1034 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states 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:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1141 transitions. [2025-03-09 01:57:54,056 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1141 transitions. Word has length 182 [2025-03-09 01:57:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:54,056 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1141 transitions. [2025-03-09 01:57:54,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.333333333333333) internal successors, (182), 42 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1141 transitions. [2025-03-09 01:57:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-09 01:57:54,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:54,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-09 01:57:54,057 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:54,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1473781685, now seen corresponding path program 1 times [2025-03-09 01:57:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:54,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406425247] [2025-03-09 01:57:54,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-09 01:57:54,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-09 01:57:54,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:54,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:54,662 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:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406425247] [2025-03-09 01:57:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406425247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2025-03-09 01:57:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766767649] [2025-03-09 01:57:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:54,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-09 01:57:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:54,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 01:57:54,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:57:54,664 INFO L87 Difference]: Start difference. First operand 1035 states and 1141 transitions. Second operand has 43 states, 43 states have (on average 4.325581395348837) internal successors, (186), 43 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:55,099 INFO L93 Difference]: Finished difference Result 1659 states and 1840 transitions. [2025-03-09 01:57:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-09 01:57:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.325581395348837) internal successors, (186), 43 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2025-03-09 01:57:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:55,100 INFO L225 Difference]: With dead ends: 1659 [2025-03-09 01:57:55,100 INFO L226 Difference]: Without dead ends: 1006 [2025-03-09 01:57:55,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:57:55,102 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:55,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 585 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-09 01:57:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2025-03-09 01:57:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 982 states have (on average 1.1283095723014256) internal successors, (1108), 1005 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states 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:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1108 transitions. [2025-03-09 01:57:55,107 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1108 transitions. Word has length 186 [2025-03-09 01:57:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1108 transitions. [2025-03-09 01:57:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.325581395348837) internal successors, (186), 43 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1108 transitions. [2025-03-09 01:57:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-09 01:57:55,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:55,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-09 01:57:55,108 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:55,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash -470250161, now seen corresponding path program 1 times [2025-03-09 01:57:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599888986] [2025-03-09 01:57:55,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:55,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-09 01:57:55,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-09 01:57:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:55,757 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:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:55,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599888986] [2025-03-09 01:57:55,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599888986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:55,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:55,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2025-03-09 01:57:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285829641] [2025-03-09 01:57:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:55,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-09 01:57:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:55,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-09 01:57:55,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 01:57:55,759 INFO L87 Difference]: Start difference. First operand 1006 states and 1108 transitions. Second operand has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:56,185 INFO L93 Difference]: Finished difference Result 1605 states and 1779 transitions. [2025-03-09 01:57:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-09 01:57:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2025-03-09 01:57:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:56,187 INFO L225 Difference]: With dead ends: 1605 [2025-03-09 01:57:56,187 INFO L226 Difference]: Without dead ends: 977 [2025-03-09 01:57:56,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 01:57:56,188 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 2 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:56,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 639 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-09 01:57:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-09 01:57:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 954 states have (on average 1.1268343815513626) internal successors, (1075), 976 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1075 transitions. [2025-03-09 01:57:56,192 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1075 transitions. Word has length 190 [2025-03-09 01:57:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:56,192 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1075 transitions. [2025-03-09 01:57:56,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1075 transitions. [2025-03-09 01:57:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-09 01:57:56,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:56,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-09 01:57:56,193 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1754016105, now seen corresponding path program 1 times [2025-03-09 01:57:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844331986] [2025-03-09 01:57:56,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:56,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-09 01:57:56,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-09 01:57:56,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:56,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:56,871 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:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844331986] [2025-03-09 01:57:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844331986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2025-03-09 01:57:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252414432] [2025-03-09 01:57:56,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:56,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-09 01:57:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:56,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-09 01:57:56,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 01:57:56,872 INFO L87 Difference]: Start difference. First operand 977 states and 1075 transitions. Second operand has 45 states, 45 states have (on average 4.311111111111111) internal successors, (194), 45 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:57,214 INFO L93 Difference]: Finished difference Result 1551 states and 1718 transitions. [2025-03-09 01:57:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-09 01:57:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.311111111111111) internal successors, (194), 45 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2025-03-09 01:57:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:57,215 INFO L225 Difference]: With dead ends: 1551 [2025-03-09 01:57:57,215 INFO L226 Difference]: Without dead ends: 948 [2025-03-09 01:57:57,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 01:57:57,216 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:57,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 395 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:57:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-09 01:57:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2025-03-09 01:57:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 926 states have (on average 1.125269978401728) internal successors, (1042), 947 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states 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:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1042 transitions. [2025-03-09 01:57:57,229 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1042 transitions. Word has length 194 [2025-03-09 01:57:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:57,229 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1042 transitions. [2025-03-09 01:57:57,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.311111111111111) internal successors, (194), 45 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1042 transitions. [2025-03-09 01:57:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-09 01:57:57,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:57,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-09 01:57:57,230 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:57,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 56079363, now seen corresponding path program 1 times [2025-03-09 01:57:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048823244] [2025-03-09 01:57:57,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:57,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-09 01:57:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-09 01:57:57,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:57,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:57,942 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:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048823244] [2025-03-09 01:57:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048823244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:57,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-09 01:57:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231020594] [2025-03-09 01:57:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-09 01:57:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:57,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-09 01:57:57,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:57:57,943 INFO L87 Difference]: Start difference. First operand 948 states and 1042 transitions. Second operand has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:58,412 INFO L93 Difference]: Finished difference Result 1497 states and 1657 transitions. [2025-03-09 01:57:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 01:57:58,413 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-03-09 01:57:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:58,414 INFO L225 Difference]: With dead ends: 1497 [2025-03-09 01:57:58,414 INFO L226 Difference]: Without dead ends: 919 [2025-03-09 01:57:58,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:57:58,415 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:58,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 659 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:57:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-03-09 01:57:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2025-03-09 01:57:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 898 states have (on average 1.123608017817372) internal successors, (1009), 918 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states 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:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1009 transitions. [2025-03-09 01:57:58,419 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1009 transitions. Word has length 198 [2025-03-09 01:57:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:58,419 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1009 transitions. [2025-03-09 01:57:58,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1009 transitions. [2025-03-09 01:57:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-09 01:57:58,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:58,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-09 01:57:58,420 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:58,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash -507515619, now seen corresponding path program 1 times [2025-03-09 01:57:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274651830] [2025-03-09 01:57:58,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:58,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-09 01:57:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-09 01:57:58,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:59,156 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:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274651830] [2025-03-09 01:57:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274651830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:59,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:59,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2025-03-09 01:57:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307460507] [2025-03-09 01:57:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:59,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-09 01:57:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:59,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-09 01:57:59,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 01:57:59,157 INFO L87 Difference]: Start difference. First operand 919 states and 1009 transitions. Second operand has 47 states, 47 states have (on average 4.297872340425532) internal successors, (202), 47 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:59,437 INFO L93 Difference]: Finished difference Result 1443 states and 1596 transitions. [2025-03-09 01:57:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-09 01:57:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.297872340425532) internal successors, (202), 47 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-03-09 01:57:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:59,439 INFO L225 Difference]: With dead ends: 1443 [2025-03-09 01:57:59,439 INFO L226 Difference]: Without dead ends: 890 [2025-03-09 01:57:59,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 01:57:59,440 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:59,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 296 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:57:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-03-09 01:57:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2025-03-09 01:57:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 870 states have (on average 1.1218390804597702) internal successors, (976), 889 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 976 transitions. [2025-03-09 01:57:59,444 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 976 transitions. Word has length 202 [2025-03-09 01:57:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:59,444 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 976 transitions. [2025-03-09 01:57:59,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.297872340425532) internal successors, (202), 47 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 976 transitions. [2025-03-09 01:57:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-09 01:57:59,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:59,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-09 01:57:59,445 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:57:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1892258999, now seen corresponding path program 1 times [2025-03-09 01:57:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920483599] [2025-03-09 01:57:59,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:59,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-09 01:57:59,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-09 01:57:59,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:59,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:00,250 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:58:00,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:00,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920483599] [2025-03-09 01:58:00,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920483599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:00,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:00,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2025-03-09 01:58:00,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243101279] [2025-03-09 01:58:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:00,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 01:58:00,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:00,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 01:58:00,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:58:00,251 INFO L87 Difference]: Start difference. First operand 890 states and 976 transitions. Second operand has 48 states, 48 states have (on average 4.291666666666667) internal successors, (206), 48 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:58:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:00,810 INFO L93 Difference]: Finished difference Result 1389 states and 1535 transitions. [2025-03-09 01:58:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 01:58:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.291666666666667) internal successors, (206), 48 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-03-09 01:58:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:00,812 INFO L225 Difference]: With dead ends: 1389 [2025-03-09 01:58:00,812 INFO L226 Difference]: Without dead ends: 861 [2025-03-09 01:58:00,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:58:00,813 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 2 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:00,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 667 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:58:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-09 01:58:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2025-03-09 01:58:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 842 states have (on average 1.1199524940617578) internal successors, (943), 860 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:58:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 943 transitions. [2025-03-09 01:58:00,818 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 943 transitions. Word has length 206 [2025-03-09 01:58:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:00,818 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 943 transitions. [2025-03-09 01:58:00,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.291666666666667) internal successors, (206), 48 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:58:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 943 transitions. [2025-03-09 01:58:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-09 01:58:00,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:00,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-09 01:58:00,819 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:00,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1927714095, now seen corresponding path program 1 times [2025-03-09 01:58:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393654149] [2025-03-09 01:58:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:00,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-09 01:58:00,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-09 01:58:00,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:00,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,698 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:58:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393654149] [2025-03-09 01:58:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393654149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2025-03-09 01:58:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807441570] [2025-03-09 01:58:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-09 01:58:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-09 01:58:01,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 01:58:01,699 INFO L87 Difference]: Start difference. First operand 861 states and 943 transitions. Second operand has 49 states, 49 states have (on average 4.285714285714286) internal successors, (210), 49 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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:58:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,189 INFO L93 Difference]: Finished difference Result 1335 states and 1474 transitions. [2025-03-09 01:58:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-09 01:58:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.285714285714286) internal successors, (210), 49 states have internal predecessors, (210), 0 states have call successors, (0), 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:58:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,190 INFO L225 Difference]: With dead ends: 1335 [2025-03-09 01:58:02,190 INFO L226 Difference]: Without dead ends: 832 [2025-03-09 01:58:02,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 01:58:02,191 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 2 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 575 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:58:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-09 01:58:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-09 01:58:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 814 states have (on average 1.117936117936118) internal successors, (910), 831 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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:58:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 910 transitions. [2025-03-09 01:58:02,195 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 910 transitions. Word has length 210 [2025-03-09 01:58:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,196 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 910 transitions. [2025-03-09 01:58:02,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.285714285714286) internal successors, (210), 49 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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:58:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 910 transitions. [2025-03-09 01:58:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-09 01:58:02,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:02,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-09 01:58:02,197 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1292619925, now seen corresponding path program 1 times [2025-03-09 01:58:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367708692] [2025-03-09 01:58:02,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-09 01:58:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-09 01:58:02,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,023 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:58:03,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:03,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367708692] [2025-03-09 01:58:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367708692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2025-03-09 01:58:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894334712] [2025-03-09 01:58:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:03,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-09 01:58:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:03,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-09 01:58:03,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:58:03,024 INFO L87 Difference]: Start difference. First operand 832 states and 910 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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:58:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:03,534 INFO L93 Difference]: Finished difference Result 1281 states and 1413 transitions. [2025-03-09 01:58:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-09 01:58:03,535 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-03-09 01:58:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:03,536 INFO L225 Difference]: With dead ends: 1281 [2025-03-09 01:58:03,536 INFO L226 Difference]: Without dead ends: 803 [2025-03-09 01:58:03,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:58:03,536 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:03,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 663 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:58:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-09 01:58:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-09 01:58:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 786 states have (on average 1.1157760814249365) internal successors, (877), 802 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:58:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 877 transitions. [2025-03-09 01:58:03,540 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 877 transitions. Word has length 214 [2025-03-09 01:58:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:03,541 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 877 transitions. [2025-03-09 01:58:03,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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:58:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 877 transitions. [2025-03-09 01:58:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-09 01:58:03,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:03,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:03,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-09 01:58:03,542 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 775856773, now seen corresponding path program 1 times [2025-03-09 01:58:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344380734] [2025-03-09 01:58:03,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:03,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-09 01:58:03,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-09 01:58:03,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,384 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:58:04,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344380734] [2025-03-09 01:58:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344380734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:04,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:04,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2025-03-09 01:58:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82243357] [2025-03-09 01:58:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:04,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-09 01:58:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:04,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-09 01:58:04,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2025-03-09 01:58:04,385 INFO L87 Difference]: Start difference. First operand 803 states and 877 transitions. Second operand has 51 states, 51 states have (on average 4.2745098039215685) internal successors, (218), 51 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:58:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:04,863 INFO L93 Difference]: Finished difference Result 1227 states and 1352 transitions. [2025-03-09 01:58:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-09 01:58:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.2745098039215685) internal successors, (218), 51 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-09 01:58:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:04,864 INFO L225 Difference]: With dead ends: 1227 [2025-03-09 01:58:04,864 INFO L226 Difference]: Without dead ends: 774 [2025-03-09 01:58:04,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2025-03-09 01:58:04,865 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 2 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:04,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 519 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:58:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-03-09 01:58:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2025-03-09 01:58:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 758 states have (on average 1.1134564643799472) internal successors, (844), 773 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 844 transitions. [2025-03-09 01:58:04,869 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 844 transitions. Word has length 218 [2025-03-09 01:58:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:04,869 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 844 transitions. [2025-03-09 01:58:04,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.2745098039215685) internal successors, (218), 51 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:58:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 844 transitions. [2025-03-09 01:58:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-09 01:58:04,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:04,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:04,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-09 01:58:04,870 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:04,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1249739807, now seen corresponding path program 1 times [2025-03-09 01:58:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005257164] [2025-03-09 01:58:04,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:04,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-09 01:58:04,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-09 01:58:04,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:04,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:05,767 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:58:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005257164] [2025-03-09 01:58:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005257164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:05,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2025-03-09 01:58:05,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453665210] [2025-03-09 01:58:05,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:05,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-09 01:58:05,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:05,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 01:58:05,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 01:58:05,768 INFO L87 Difference]: Start difference. First operand 774 states and 844 transitions. Second operand has 52 states, 52 states have (on average 4.269230769230769) internal successors, (222), 52 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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:58:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,208 INFO L93 Difference]: Finished difference Result 1173 states and 1291 transitions. [2025-03-09 01:58:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-09 01:58:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.269230769230769) internal successors, (222), 52 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2025-03-09 01:58:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,209 INFO L225 Difference]: With dead ends: 1173 [2025-03-09 01:58:06,209 INFO L226 Difference]: Without dead ends: 745 [2025-03-09 01:58:06,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 01:58:06,210 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 20 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 455 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:58:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-09 01:58:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2025-03-09 01:58:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 730 states have (on average 1.110958904109589) internal successors, (811), 744 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:58:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 811 transitions. [2025-03-09 01:58:06,213 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 811 transitions. Word has length 222 [2025-03-09 01:58:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,213 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 811 transitions. [2025-03-09 01:58:06,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.269230769230769) internal successors, (222), 52 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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:58:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 811 transitions. [2025-03-09 01:58:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-09 01:58:06,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:06,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-09 01:58:06,214 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:06,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:06,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2099932103, now seen corresponding path program 1 times [2025-03-09 01:58:06,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:06,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028384606] [2025-03-09 01:58:06,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:06,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-09 01:58:06,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-09 01:58:06,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:06,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,262 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:58:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028384606] [2025-03-09 01:58:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028384606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:58:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080195904] [2025-03-09 01:58:06,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:06,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:06,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:06,263 INFO L87 Difference]: Start difference. First operand 745 states and 811 transitions. Second operand has 6 states, 5 states have (on average 45.2) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,378 INFO L93 Difference]: Finished difference Result 871 states and 951 transitions. [2025-03-09 01:58:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 45.2) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-03-09 01:58:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,379 INFO L225 Difference]: With dead ends: 871 [2025-03-09 01:58:06,379 INFO L226 Difference]: Without dead ends: 856 [2025-03-09 01:58:06,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:58:06,379 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 642 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 779 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-09 01:58:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2025-03-09 01:58:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 842 states have (on average 1.1116389548693586) internal successors, (936), 855 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:58:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 936 transitions. [2025-03-09 01:58:06,385 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 936 transitions. Word has length 226 [2025-03-09 01:58:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,385 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 936 transitions. [2025-03-09 01:58:06,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.2) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 936 transitions. [2025-03-09 01:58:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-09 01:58:06,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:06,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-09 01:58:06,387 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:06,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1032480014, now seen corresponding path program 1 times [2025-03-09 01:58:06,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:06,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798138499] [2025-03-09 01:58:06,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:06,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-09 01:58:06,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-09 01:58:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,450 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:58:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:06,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798138499] [2025-03-09 01:58:06,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798138499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:06,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:06,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:58:06,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685682115] [2025-03-09 01:58:06,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:06,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:58:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:06,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:58:06,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:58:06,452 INFO L87 Difference]: Start difference. First operand 856 states and 936 transitions. Second operand has 7 states, 6 states have (on average 38.666666666666664) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:58:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,625 INFO L93 Difference]: Finished difference Result 973 states and 1066 transitions. [2025-03-09 01:58:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:58:06,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 38.666666666666664) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-09 01:58:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,626 INFO L225 Difference]: With dead ends: 973 [2025-03-09 01:58:06,626 INFO L226 Difference]: Without dead ends: 959 [2025-03-09 01:58:06,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:58:06,626 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1233 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 868 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-09 01:58:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2025-03-09 01:58:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 946 states have (on average 1.1120507399577166) internal successors, (1052), 958 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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:58:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1052 transitions. [2025-03-09 01:58:06,630 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1052 transitions. Word has length 232 [2025-03-09 01:58:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1052 transitions. [2025-03-09 01:58:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 38.666666666666664) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:58:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1052 transitions. [2025-03-09 01:58:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-09 01:58:06,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:06,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-09 01:58:06,631 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:06,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1243388971, now seen corresponding path program 1 times [2025-03-09 01:58:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:06,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106995265] [2025-03-09 01:58:06,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:06,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:06,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-09 01:58:06,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-09 01:58:06,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:06,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,704 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:58:06,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:06,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106995265] [2025-03-09 01:58:06,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106995265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:06,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:06,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:58:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972941121] [2025-03-09 01:58:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:06,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:58:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:06,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:58:06,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:58:06,705 INFO L87 Difference]: Start difference. First operand 959 states and 1052 transitions. Second operand has 8 states, 7 states have (on average 34.0) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:58:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,871 INFO L93 Difference]: Finished difference Result 1067 states and 1172 transitions. [2025-03-09 01:58:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:58:06,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 34.0) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-09 01:58:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,872 INFO L225 Difference]: With dead ends: 1067 [2025-03-09 01:58:06,872 INFO L226 Difference]: Without dead ends: 1054 [2025-03-09 01:58:06,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:58:06,873 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1619 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 950 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-09 01:58:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2025-03-09 01:58:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1042 states have (on average 1.1122840690978886) internal successors, (1159), 1053 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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:58:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1159 transitions. [2025-03-09 01:58:06,877 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1159 transitions. Word has length 238 [2025-03-09 01:58:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,878 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1159 transitions. [2025-03-09 01:58:06,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 34.0) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:58:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1159 transitions. [2025-03-09 01:58:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-09 01:58:06,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:06,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-09 01:58:06,879 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:06,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash -968575004, now seen corresponding path program 1 times [2025-03-09 01:58:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262768532] [2025-03-09 01:58:06,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:06,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-09 01:58:06,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-09 01:58:06,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:06,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,960 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:58:06,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:06,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262768532] [2025-03-09 01:58:06,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262768532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:06,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:06,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:58:06,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011228914] [2025-03-09 01:58:06,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:58:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:06,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:58:06,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:58:06,961 INFO L87 Difference]: Start difference. First operand 1054 states and 1159 transitions. Second operand has 9 states, 8 states have (on average 30.5) internal successors, (244), 9 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:58:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:07,142 INFO L93 Difference]: Finished difference Result 1153 states and 1269 transitions. [2025-03-09 01:58:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:58:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 30.5) internal successors, (244), 9 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2025-03-09 01:58:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:07,143 INFO L225 Difference]: With dead ends: 1153 [2025-03-09 01:58:07,143 INFO L226 Difference]: Without dead ends: 1141 [2025-03-09 01:58:07,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:58:07,143 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1708 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:07,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 1027 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-09 01:58:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2025-03-09 01:58:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1130 states have (on average 1.1123893805309735) internal successors, (1257), 1140 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states 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:58:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1257 transitions. [2025-03-09 01:58:07,149 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1257 transitions. Word has length 244 [2025-03-09 01:58:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:07,149 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1257 transitions. [2025-03-09 01:58:07,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 30.5) internal successors, (244), 9 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:58:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1257 transitions. [2025-03-09 01:58:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-09 01:58:07,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:07,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:07,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-09 01:58:07,150 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash -414183907, now seen corresponding path program 1 times [2025-03-09 01:58:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462847068] [2025-03-09 01:58:07,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-09 01:58:07,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-09 01:58:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:07,255 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:58:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:07,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462847068] [2025-03-09 01:58:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462847068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:07,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:07,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:58:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728801341] [2025-03-09 01:58:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:58:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:07,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:58:07,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:58:07,257 INFO L87 Difference]: Start difference. First operand 1141 states and 1257 transitions. Second operand has 10 states, 9 states have (on average 27.77777777777778) internal successors, (250), 10 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:58:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:07,477 INFO L93 Difference]: Finished difference Result 1231 states and 1357 transitions. [2025-03-09 01:58:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:58:07,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 27.77777777777778) internal successors, (250), 10 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 250 [2025-03-09 01:58:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:07,478 INFO L225 Difference]: With dead ends: 1231 [2025-03-09 01:58:07,478 INFO L226 Difference]: Without dead ends: 1220 [2025-03-09 01:58:07,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:58:07,479 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1640 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:07,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1096 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-03-09 01:58:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220. [2025-03-09 01:58:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1210 states have (on average 1.112396694214876) internal successors, (1346), 1219 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states 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:58:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1346 transitions. [2025-03-09 01:58:07,484 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1346 transitions. Word has length 250 [2025-03-09 01:58:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:07,484 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1346 transitions. [2025-03-09 01:58:07,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 27.77777777777778) internal successors, (250), 10 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:58:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1346 transitions. [2025-03-09 01:58:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-09 01:58:07,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:07,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-09 01:58:07,485 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:07,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash -746012970, now seen corresponding path program 1 times [2025-03-09 01:58:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000284042] [2025-03-09 01:58:07,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:07,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-09 01:58:07,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-09 01:58:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:07,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:07,595 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:58:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000284042] [2025-03-09 01:58:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000284042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:07,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:07,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:58:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956186886] [2025-03-09 01:58:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:58:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:07,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:58:07,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:58:07,596 INFO L87 Difference]: Start difference. First operand 1220 states and 1346 transitions. Second operand has 11 states, 10 states have (on average 25.6) internal successors, (256), 11 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:58:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:07,857 INFO L93 Difference]: Finished difference Result 1301 states and 1436 transitions. [2025-03-09 01:58:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:58:07,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 25.6) internal successors, (256), 11 states have internal predecessors, (256), 0 states have call successors, (0), 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:58:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:07,858 INFO L225 Difference]: With dead ends: 1301 [2025-03-09 01:58:07,858 INFO L226 Difference]: Without dead ends: 1291 [2025-03-09 01:58:07,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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:58:07,859 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2345 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:07,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 1158 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-09 01:58:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-03-09 01:58:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1282 states have (on average 1.1123244929797191) internal successors, (1426), 1290 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states 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:58:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1426 transitions. [2025-03-09 01:58:07,864 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1426 transitions. Word has length 256 [2025-03-09 01:58:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:07,864 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1426 transitions. [2025-03-09 01:58:07,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 25.6) internal successors, (256), 11 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:58:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1426 transitions. [2025-03-09 01:58:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-09 01:58:07,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:07,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:07,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-09 01:58:07,866 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:07,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash 421587471, now seen corresponding path program 1 times [2025-03-09 01:58:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493293212] [2025-03-09 01:58:07,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:07,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-09 01:58:07,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-09 01:58:07,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:07,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493293212] [2025-03-09 01:58:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493293212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:08,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:08,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:58:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002931040] [2025-03-09 01:58:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:08,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:58:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:08,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:58:08,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:58:08,004 INFO L87 Difference]: Start difference. First operand 1291 states and 1426 transitions. Second operand has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:58:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:08,245 INFO L93 Difference]: Finished difference Result 1363 states and 1506 transitions. [2025-03-09 01:58:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:58:08,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-03-09 01:58:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:08,247 INFO L225 Difference]: With dead ends: 1363 [2025-03-09 01:58:08,247 INFO L226 Difference]: Without dead ends: 1354 [2025-03-09 01:58:08,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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:58:08,247 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 2190 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:08,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 1214 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-09 01:58:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2025-03-09 01:58:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1346 states have (on average 1.112184249628529) internal successors, (1497), 1353 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states 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:58:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1497 transitions. [2025-03-09 01:58:08,253 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1497 transitions. Word has length 262 [2025-03-09 01:58:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1497 transitions. [2025-03-09 01:58:08,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:58:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1497 transitions. [2025-03-09 01:58:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-09 01:58:08,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:08,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-09 01:58:08,255 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:08,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 540192712, now seen corresponding path program 1 times [2025-03-09 01:58:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286178014] [2025-03-09 01:58:08,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:08,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-09 01:58:08,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-09 01:58:08,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:08,380 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:58:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286178014] [2025-03-09 01:58:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286178014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:08,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:58:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565548081] [2025-03-09 01:58:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:08,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:58:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:08,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:58:08,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:58:08,382 INFO L87 Difference]: Start difference. First operand 1354 states and 1497 transitions. Second operand has 13 states, 12 states have (on average 22.333333333333332) internal successors, (268), 13 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:58:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:08,616 INFO L93 Difference]: Finished difference Result 1417 states and 1567 transitions. [2025-03-09 01:58:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:58:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 22.333333333333332) internal successors, (268), 13 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-09 01:58:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:08,618 INFO L225 Difference]: With dead ends: 1417 [2025-03-09 01:58:08,618 INFO L226 Difference]: Without dead ends: 1409 [2025-03-09 01:58:08,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:58:08,619 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1690 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:08,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 1264 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-09 01:58:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409. [2025-03-09 01:58:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1402 states have (on average 1.1119828815977175) internal successors, (1559), 1408 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states 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:58:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1559 transitions. [2025-03-09 01:58:08,625 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1559 transitions. Word has length 268 [2025-03-09 01:58:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:08,625 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1559 transitions. [2025-03-09 01:58:08,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 22.333333333333332) internal successors, (268), 13 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:58:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1559 transitions. [2025-03-09 01:58:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-09 01:58:08,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:08,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:08,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-09 01:58:08,627 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 482357249, now seen corresponding path program 1 times [2025-03-09 01:58:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893224465] [2025-03-09 01:58:08,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:08,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-09 01:58:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-09 01:58:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:08,761 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:58:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893224465] [2025-03-09 01:58:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893224465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 01:58:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241861356] [2025-03-09 01:58:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:58:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:08,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:58:08,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:58:08,762 INFO L87 Difference]: Start difference. First operand 1409 states and 1559 transitions. Second operand has 14 states, 13 states have (on average 21.076923076923077) internal successors, (274), 14 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:58:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:09,030 INFO L93 Difference]: Finished difference Result 1463 states and 1619 transitions. [2025-03-09 01:58:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:58:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 21.076923076923077) internal successors, (274), 14 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-03-09 01:58:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:09,032 INFO L225 Difference]: With dead ends: 1463 [2025-03-09 01:58:09,032 INFO L226 Difference]: Without dead ends: 1456 [2025-03-09 01:58:09,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:58:09,033 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 2757 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2757 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2757 Valid, 1302 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-09 01:58:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2025-03-09 01:58:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1450 states have (on average 1.1117241379310345) internal successors, (1612), 1455 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states 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:58:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1612 transitions. [2025-03-09 01:58:09,040 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1612 transitions. Word has length 274 [2025-03-09 01:58:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:09,040 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1612 transitions. [2025-03-09 01:58:09,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 21.076923076923077) internal successors, (274), 14 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:58:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1612 transitions. [2025-03-09 01:58:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-09 01:58:09,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:09,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-09 01:58:09,042 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:09,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2135717190, now seen corresponding path program 1 times [2025-03-09 01:58:09,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:09,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943037768] [2025-03-09 01:58:09,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:09,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:09,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-09 01:58:09,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-09 01:58:09,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:09,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:09,191 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:58:09,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:09,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943037768] [2025-03-09 01:58:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943037768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:09,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:09,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 01:58:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429421355] [2025-03-09 01:58:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:09,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:58:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:09,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:58:09,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:58:09,192 INFO L87 Difference]: Start difference. First operand 1456 states and 1612 transitions. Second operand has 15 states, 14 states have (on average 20.0) internal successors, (280), 15 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:58:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:09,455 INFO L93 Difference]: Finished difference Result 1501 states and 1662 transitions. [2025-03-09 01:58:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:58:09,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 20.0) internal successors, (280), 15 states have internal predecessors, (280), 0 states have call successors, (0), 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 280 [2025-03-09 01:58:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:09,456 INFO L225 Difference]: With dead ends: 1501 [2025-03-09 01:58:09,456 INFO L226 Difference]: Without dead ends: 1495 [2025-03-09 01:58:09,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:58:09,457 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 2054 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2054 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:09,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2054 Valid, 1339 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-03-09 01:58:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2025-03-09 01:58:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1490 states have (on average 1.1114093959731544) internal successors, (1656), 1494 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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:58:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1656 transitions. [2025-03-09 01:58:09,463 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1656 transitions. Word has length 280 [2025-03-09 01:58:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:09,463 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1656 transitions. [2025-03-09 01:58:09,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 20.0) internal successors, (280), 15 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:58:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1656 transitions. [2025-03-09 01:58:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-09 01:58:09,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:09,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-09 01:58:09,465 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -304160781, now seen corresponding path program 1 times [2025-03-09 01:58:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794879035] [2025-03-09 01:58:09,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:09,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-09 01:58:09,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-09 01:58:09,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:09,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:09,626 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:58:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794879035] [2025-03-09 01:58:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794879035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 01:58:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169369876] [2025-03-09 01:58:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:09,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:58:09,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:09,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:58:09,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:58:09,627 INFO L87 Difference]: Start difference. First operand 1495 states and 1656 transitions. Second operand has 16 states, 15 states have (on average 19.066666666666666) internal successors, (286), 16 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:58:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:09,895 INFO L93 Difference]: Finished difference Result 1531 states and 1696 transitions. [2025-03-09 01:58:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:58:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 19.066666666666666) internal successors, (286), 16 states have internal predecessors, (286), 0 states have call successors, (0), 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 286 [2025-03-09 01:58:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:09,897 INFO L225 Difference]: With dead ends: 1531 [2025-03-09 01:58:09,897 INFO L226 Difference]: Without dead ends: 1526 [2025-03-09 01:58:09,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:58:09,897 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 2122 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:09,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 1367 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-03-09 01:58:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2025-03-09 01:58:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1522 states have (on average 1.1110381077529565) internal successors, (1691), 1525 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states 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:58:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1691 transitions. [2025-03-09 01:58:09,904 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1691 transitions. Word has length 286 [2025-03-09 01:58:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1691 transitions. [2025-03-09 01:58:09,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 19.066666666666666) internal successors, (286), 16 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:58:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1691 transitions. [2025-03-09 01:58:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-09 01:58:09,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:09,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-09 01:58:09,906 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1476636756, now seen corresponding path program 1 times [2025-03-09 01:58:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346905663] [2025-03-09 01:58:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:09,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-09 01:58:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-09 01:58:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:09,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:10,091 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:58:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:10,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346905663] [2025-03-09 01:58:10,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346905663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:10,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 01:58:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785122644] [2025-03-09 01:58:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:10,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:58:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:10,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:58:10,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:58:10,092 INFO L87 Difference]: Start difference. First operand 1526 states and 1691 transitions. Second operand has 17 states, 16 states have (on average 18.25) internal successors, (292), 17 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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:58:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:10,380 INFO L93 Difference]: Finished difference Result 1553 states and 1721 transitions. [2025-03-09 01:58:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:58:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 18.25) internal successors, (292), 17 states have internal predecessors, (292), 0 states have call successors, (0), 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 292 [2025-03-09 01:58:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:10,382 INFO L225 Difference]: With dead ends: 1553 [2025-03-09 01:58:10,382 INFO L226 Difference]: Without dead ends: 1549 [2025-03-09 01:58:10,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:58:10,382 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 2707 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2707 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:10,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2707 Valid, 1384 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-09 01:58:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1549. [2025-03-09 01:58:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1546 states have (on average 1.110608020698577) internal successors, (1717), 1548 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states 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:58:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1717 transitions. [2025-03-09 01:58:10,388 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1717 transitions. Word has length 292 [2025-03-09 01:58:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:10,389 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 1717 transitions. [2025-03-09 01:58:10,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 18.25) internal successors, (292), 17 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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:58:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1717 transitions. [2025-03-09 01:58:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-09 01:58:10,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:10,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-09 01:58:10,390 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2035418651, now seen corresponding path program 1 times [2025-03-09 01:58:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855850069] [2025-03-09 01:58:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-09 01:58:10,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-09 01:58:10,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:10,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:10,587 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:58:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855850069] [2025-03-09 01:58:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855850069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 01:58:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012699315] [2025-03-09 01:58:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:58:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:58:10,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:58:10,588 INFO L87 Difference]: Start difference. First operand 1549 states and 1717 transitions. Second operand has 18 states, 17 states have (on average 17.529411764705884) internal successors, (298), 18 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:58:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:10,899 INFO L93 Difference]: Finished difference Result 1567 states and 1737 transitions. [2025-03-09 01:58:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:58:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 17.529411764705884) internal successors, (298), 18 states have internal predecessors, (298), 0 states have call successors, (0), 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 298 [2025-03-09 01:58:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:10,900 INFO L225 Difference]: With dead ends: 1567 [2025-03-09 01:58:10,900 INFO L226 Difference]: Without dead ends: 1564 [2025-03-09 01:58:10,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:58:10,900 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2840 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:10,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 1398 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2025-03-09 01:58:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2025-03-09 01:58:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1562 states have (on average 1.1101152368758003) internal successors, (1734), 1563 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states 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:58:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1734 transitions. [2025-03-09 01:58:10,907 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1734 transitions. Word has length 298 [2025-03-09 01:58:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:10,907 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 1734 transitions. [2025-03-09 01:58:10,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 17.529411764705884) internal successors, (298), 18 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:58:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1734 transitions. [2025-03-09 01:58:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-09 01:58:10,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:10,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:10,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-09 01:58:10,909 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1736310430, now seen corresponding path program 1 times [2025-03-09 01:58:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416176800] [2025-03-09 01:58:10,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:10,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-09 01:58:10,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-09 01:58:10,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:10,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:11,118 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:58:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416176800] [2025-03-09 01:58:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416176800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-09 01:58:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405213729] [2025-03-09 01:58:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:11,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:58:11,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:11,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:58:11,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:58:11,119 INFO L87 Difference]: Start difference. First operand 1564 states and 1734 transitions. Second operand has 19 states, 18 states have (on average 16.88888888888889) internal successors, (304), 19 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:58:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:11,429 INFO L93 Difference]: Finished difference Result 1573 states and 1744 transitions. [2025-03-09 01:58:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:58:11,430 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 16.88888888888889) internal successors, (304), 19 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2025-03-09 01:58:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:11,431 INFO L225 Difference]: With dead ends: 1573 [2025-03-09 01:58:11,431 INFO L226 Difference]: Without dead ends: 1571 [2025-03-09 01:58:11,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:58:11,431 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 2610 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:11,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 1404 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-03-09 01:58:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2025-03-09 01:58:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.1095541401273885) internal successors, (1742), 1570 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states 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:58:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1742 transitions. [2025-03-09 01:58:11,438 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1742 transitions. Word has length 304 [2025-03-09 01:58:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:11,438 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 1742 transitions. [2025-03-09 01:58:11,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 16.88888888888889) internal successors, (304), 19 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:58:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1742 transitions. [2025-03-09 01:58:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-09 01:58:11,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:11,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-09 01:58:11,440 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:11,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 529903378, now seen corresponding path program 1 times [2025-03-09 01:58:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337567425] [2025-03-09 01:58:11,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:11,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-09 01:58:11,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-09 01:58:11,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:11,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337567425] [2025-03-09 01:58:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337567425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-09 01:58:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234524250] [2025-03-09 01:58:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:11,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:58:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:11,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:58:11,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:58:11,669 INFO L87 Difference]: Start difference. First operand 1571 states and 1742 transitions. Second operand has 20 states, 19 states have (on average 16.31578947368421) internal successors, (310), 20 states have internal predecessors, (310), 0 states have call successors, (0), 0 states 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:58:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:11,986 INFO L93 Difference]: Finished difference Result 1580 states and 1752 transitions. [2025-03-09 01:58:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:58:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.31578947368421) internal successors, (310), 20 states have internal predecessors, (310), 0 states have call successors, (0), 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 310 [2025-03-09 01:58:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:11,988 INFO L225 Difference]: With dead ends: 1580 [2025-03-09 01:58:11,988 INFO L226 Difference]: Without dead ends: 1579 [2025-03-09 01:58:11,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 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:58:11,988 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 2879 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:11,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 1411 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-03-09 01:58:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2025-03-09 01:58:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 1.1096324461343472) internal successors, (1751), 1578 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states 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:58:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1751 transitions. [2025-03-09 01:58:11,995 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1751 transitions. Word has length 310 [2025-03-09 01:58:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 1751 transitions. [2025-03-09 01:58:11,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.31578947368421) internal successors, (310), 20 states have internal predecessors, (310), 0 states have call successors, (0), 0 states 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:58:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1751 transitions. [2025-03-09 01:58:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-09 01:58:11,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:11,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-09 01:58:11,997 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1803303046, now seen corresponding path program 1 times [2025-03-09 01:58:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53030592] [2025-03-09 01:58:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:12,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-09 01:58:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-09 01:58:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53030592] [2025-03-09 01:58:12,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53030592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562310659] [2025-03-09 01:58:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:12,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:12,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:12,245 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:58:12,245 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:58:12,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-09 01:58:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-09 01:58:12,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:12,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:58:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:12,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562310659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:13,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:13,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-03-09 01:58:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274895419] [2025-03-09 01:58:13,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:13,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:58:13,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:13,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:58:13,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:58:13,232 INFO L87 Difference]: Start difference. First operand 1579 states and 1751 transitions. Second operand has 40 states, 39 states have (on average 16.17948717948718) internal successors, (631), 40 states have internal predecessors, (631), 0 states have call successors, (0), 0 states 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:58:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:13,924 INFO L93 Difference]: Finished difference Result 1740 states and 1951 transitions. [2025-03-09 01:58:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 01:58:13,925 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 16.17948717948718) internal successors, (631), 40 states have internal predecessors, (631), 0 states have call successors, (0), 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:58:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:13,926 INFO L225 Difference]: With dead ends: 1740 [2025-03-09 01:58:13,926 INFO L226 Difference]: Without dead ends: 1739 [2025-03-09 01:58:13,927 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:58:13,927 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 4741 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4741 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:13,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4741 Valid, 1551 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:58:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-03-09 01:58:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1739. [2025-03-09 01:58:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.1110471806674338) internal successors, (1931), 1738 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states 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:58:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 1931 transitions. [2025-03-09 01:58:13,935 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 1931 transitions. Word has length 316 [2025-03-09 01:58:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 1931 transitions. [2025-03-09 01:58:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 16.17948717948718) internal successors, (631), 40 states have internal predecessors, (631), 0 states have call successors, (0), 0 states 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:58:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 1931 transitions. [2025-03-09 01:58:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-09 01:58:13,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:13,937 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:13,945 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:58:14,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:14,138 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:14,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash 146929558, now seen corresponding path program 2 times [2025-03-09 01:58:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:14,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918232849] [2025-03-09 01:58:14,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:14,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 436 statements into 2 equivalence classes. [2025-03-09 01:58:14,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 436 of 436 statements. [2025-03-09 01:58:14,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:14,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 1386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:15,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918232849] [2025-03-09 01:58:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918232849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036188103] [2025-03-09 01:58:15,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:15,048 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:58:15,048 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:58:15,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 436 statements into 2 equivalence classes. [2025-03-09 01:58:15,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 436 of 436 statements. [2025-03-09 01:58:15,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:15,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:15,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:58:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 1386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:15,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 1386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036188103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:17,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2025-03-09 01:58:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063047047] [2025-03-09 01:58:17,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:17,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-03-09 01:58:17,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:17,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-03-09 01:58:17,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2025-03-09 01:58:17,062 INFO L87 Difference]: Start difference. First operand 1739 states and 1931 transitions. Second operand has 80 states, 79 states have (on average 11.025316455696203) internal successors, (871), 80 states have internal predecessors, (871), 0 states have call successors, (0), 0 states 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:58:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:19,258 INFO L93 Difference]: Finished difference Result 2060 states and 2331 transitions. [2025-03-09 01:58:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-09 01:58:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 11.025316455696203) internal successors, (871), 80 states have internal predecessors, (871), 0 states have call successors, (0), 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:58:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:19,259 INFO L225 Difference]: With dead ends: 2060 [2025-03-09 01:58:19,259 INFO L226 Difference]: Without dead ends: 2059 [2025-03-09 01:58:19,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2025-03-09 01:58:19,260 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 4700 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4700 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:19,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4700 Valid, 1829 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:58:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2025-03-09 01:58:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2025-03-09 01:58:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 2058 states have (on average 1.1132167152575316) internal successors, (2291), 2058 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states 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:58:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2291 transitions. [2025-03-09 01:58:19,269 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2291 transitions. Word has length 436 [2025-03-09 01:58:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 2059 states and 2291 transitions. [2025-03-09 01:58:19,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 11.025316455696203) internal successors, (871), 80 states have internal predecessors, (871), 0 states have call successors, (0), 0 states 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:58:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2291 transitions. [2025-03-09 01:58:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2025-03-09 01:58:19,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:19,273 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 62, 62, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:58:19,476 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,SelfDestructingSolverStorable72 [2025-03-09 01:58:19,476 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2025-03-09 01:58:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1153260106, now seen corresponding path program 3 times [2025-03-09 01:58:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548451805] [2025-03-09 01:58:19,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:19,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 676 statements into 62 equivalence classes. [2025-03-09 01:58:19,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) and asserted 670 of 676 statements. [2025-03-09 01:58:19,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2025-03-09 01:58:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11346 backedges. 10994 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-09 01:58:21,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548451805] [2025-03-09 01:58:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548451805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:21,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2025-03-09 01:58:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268120624] [2025-03-09 01:58:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:21,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-09 01:58:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:21,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-09 01:58:21,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 01:58:21,195 INFO L87 Difference]: Start difference. First operand 2059 states and 2291 transitions. Second operand has 53 states, 53 states have (on average 11.60377358490566) internal successors, (615), 53 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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:58:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:22,952 INFO L93 Difference]: Finished difference Result 3074 states and 3475 transitions. [2025-03-09 01:58:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-09 01:58:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 11.60377358490566) internal successors, (615), 53 states have internal predecessors, (615), 0 states have call successors, (0), 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:58:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:22,953 INFO L225 Difference]: With dead ends: 3074 [2025-03-09 01:58:22,953 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:58:22,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 01:58:22,955 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 781 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 5330 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 5534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 5330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2478 Invalid, 5534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 5330 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 01:58:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:58:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:58:22,955 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:58:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:58:22,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 676 [2025-03-09 01:58:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:22,955 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:58:22,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 11.60377358490566) internal successors, (615), 53 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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:58:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:58:22,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:58:22,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (407 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (406 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (405 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (404 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (403 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (402 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (401 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (400 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (399 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (398 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (397 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (396 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (395 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (394 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (393 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (392 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (391 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (390 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (389 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (388 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (387 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (386 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (385 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (384 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (383 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (382 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (381 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (380 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (379 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (378 of 408 remaining) [2025-03-09 01:58:22,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (377 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (376 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (375 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (374 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (373 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (372 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (371 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (370 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (369 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (368 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (367 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (366 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (365 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (364 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (363 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (362 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (361 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (360 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (359 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (358 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (357 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (356 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (355 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (354 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (353 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (352 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (351 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (350 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (349 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (348 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (347 of 408 remaining) [2025-03-09 01:58:22,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (346 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (345 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (344 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (343 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (342 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (341 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (340 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (339 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (338 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (337 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (336 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (335 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (334 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (333 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (332 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (331 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (330 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (329 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (328 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (327 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (326 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (325 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (324 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (323 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (322 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (321 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (320 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (319 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (318 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (317 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (316 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (315 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (314 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (313 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (312 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (311 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (310 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (309 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (308 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (307 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (306 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (305 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (304 of 408 remaining) [2025-03-09 01:58:22,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (303 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (302 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (301 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (300 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (299 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (298 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (297 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (296 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (295 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (294 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (293 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (292 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (291 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (290 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (289 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (288 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (287 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (286 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (285 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (284 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (283 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (282 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (281 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (280 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (279 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (278 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (277 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (276 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (275 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (274 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (273 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (272 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (271 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (270 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (269 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (268 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (267 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (266 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (265 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (264 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (263 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (262 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (261 of 408 remaining) [2025-03-09 01:58:22,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (260 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (259 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (258 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (257 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (256 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (255 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (254 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (253 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (252 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (251 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (250 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (249 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (248 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (247 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (246 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (245 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (244 of 408 remaining) [2025-03-09 01:58:22,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (243 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (242 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW (241 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW (240 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW (239 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW (238 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW (237 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW (236 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW (235 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW (234 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW (233 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW (232 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW (231 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr177ASSERT_VIOLATIONINTEGER_OVERFLOW (230 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW (229 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW (228 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr180ASSERT_VIOLATIONINTEGER_OVERFLOW (227 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr181ASSERT_VIOLATIONINTEGER_OVERFLOW (226 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW (225 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW (224 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr184ASSERT_VIOLATIONINTEGER_OVERFLOW (223 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr185ASSERT_VIOLATIONINTEGER_OVERFLOW (222 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr186ASSERT_VIOLATIONINTEGER_OVERFLOW (221 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW (220 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW (219 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr189ASSERT_VIOLATIONINTEGER_OVERFLOW (218 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr190ASSERT_VIOLATIONINTEGER_OVERFLOW (217 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW (216 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr192ASSERT_VIOLATIONINTEGER_OVERFLOW (215 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr193ASSERT_VIOLATIONINTEGER_OVERFLOW (214 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW (213 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW (212 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr196ASSERT_VIOLATIONINTEGER_OVERFLOW (211 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr197ASSERT_VIOLATIONINTEGER_OVERFLOW (210 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr198ASSERT_VIOLATIONINTEGER_OVERFLOW (209 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW (208 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW (207 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr201ASSERT_VIOLATIONINTEGER_OVERFLOW (206 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr202ASSERT_VIOLATIONINTEGER_OVERFLOW (205 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW (204 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr204ASSERT_VIOLATIONINTEGER_OVERFLOW (203 of 408 remaining) [2025-03-09 01:58:22,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr205ASSERT_VIOLATIONINTEGER_OVERFLOW (202 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW (201 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW (200 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr208ASSERT_VIOLATIONINTEGER_OVERFLOW (199 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr209ASSERT_VIOLATIONINTEGER_OVERFLOW (198 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr210ASSERT_VIOLATIONINTEGER_OVERFLOW (197 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW (196 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW (195 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr213ASSERT_VIOLATIONINTEGER_OVERFLOW (194 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW (193 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW (192 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr216ASSERT_VIOLATIONINTEGER_OVERFLOW (191 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr217ASSERT_VIOLATIONINTEGER_OVERFLOW (190 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW (189 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW (188 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW (187 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW (186 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr222ASSERT_VIOLATIONINTEGER_OVERFLOW (185 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr223ASSERT_VIOLATIONINTEGER_OVERFLOW (184 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr224ASSERT_VIOLATIONINTEGER_OVERFLOW (183 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr225ASSERT_VIOLATIONINTEGER_OVERFLOW (182 of 408 remaining) [2025-03-09 01:58:22,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr226ASSERT_VIOLATIONINTEGER_OVERFLOW (181 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr227ASSERT_VIOLATIONINTEGER_OVERFLOW (180 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr228ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr229ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr230ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr231ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr232ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr233ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr234ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr235ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr236ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr237ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr238ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr239ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr240ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr241ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr242ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr243ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr244ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr245ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr246ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr247ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr248ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr249ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr250ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 408 remaining) [2025-03-09 01:58:22,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr251ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr252ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr253ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr254ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr255ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr256ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr257ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr258ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr259ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr260ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr261ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr262ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr263ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr264ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 408 remaining) [2025-03-09 01:58:22,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr265ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr266ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr267ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr268ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr269ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr270ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr271ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr272ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr273ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr274ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr275ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr276ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr277ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr278ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr279ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr280ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr281ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr282ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr283ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr284ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr285ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr286ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr287ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr288ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr289ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr290ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr291ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr292ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr293ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr294ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr295ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr296ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr297ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr298ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr299ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr300ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr301ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr302ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 408 remaining) [2025-03-09 01:58:22,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr303ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr304ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr305ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr306ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr307ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr308ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr309ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr310ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr311ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr312ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr313ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr314ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr315ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr316ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr317ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 408 remaining) [2025-03-09 01:58:22,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr318ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr319ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr320ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr321ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr322ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr323ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr324ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr325ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr326ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr327ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr328ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr329ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr330ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr331ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr332ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr333ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr334ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 408 remaining) [2025-03-09 01:58:22,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr335ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr336ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr337ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr338ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr339ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr340ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr341ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr342ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr343ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr344ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr345ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr346ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr347ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr348ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr349ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr350ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr351ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr352ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr353ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr354ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr355ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr356ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr357ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr358ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr359ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr360ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr361ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr362ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr363ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr364ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr365ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr366ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr367ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr368ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr369ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr370ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr371ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr372ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr373ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr374ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr375ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr376ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr377ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr378ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr379ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr380ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 408 remaining) [2025-03-09 01:58:22,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr381ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 408 remaining) [2025-03-09 01:58:22,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr382ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 408 remaining) [2025-03-09 01:58:22,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr383ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 408 remaining) [2025-03-09 01:58:22,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr384ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 408 remaining) [2025-03-09 01:58:22,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr385ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 408 remaining) [2025-03-09 01:58:22,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr386ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 408 remaining) [2025-03-09 01:58:22,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr387ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr388ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr389ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr390ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr391ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr392ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr393ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr394ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr395ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr396ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr397ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr398ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr399ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr400ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr401ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr402ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr403ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr404ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr405ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr406ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 408 remaining) [2025-03-09 01:58:22,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr407ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 408 remaining) [2025-03-09 01:58:22,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-09 01:58:22,976 INFO L422 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 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:58:22,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:58:22,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:58:22,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:58:22 BoogieIcfgContainer [2025-03-09 01:58:22,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:58:22,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:58:22,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:58:22,990 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:58:22,990 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:18" (3/4) ... [2025-03-09 01:58:22,992 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:58:23,009 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 01:58:23,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:58:23,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:58:23,012 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:58:23,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:58:23,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:58:23,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:58:23,097 INFO L158 Benchmark]: Toolchain (without parser) took 66134.43ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 113.1MB in the beginning and 428.5MB in the end (delta: -315.4MB). Peak memory consumption was 182.3MB. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.78ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 93.8MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.85ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: Boogie Preprocessor took 41.66ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: IcfgBuilder took 1037.56ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 61.4MB in the end (delta: 25.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: TraceAbstraction took 64625.72ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 60.6MB in the beginning and 445.3MB in the end (delta: -384.6MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2025-03-09 01:58:23,098 INFO L158 Benchmark]: Witness Printer took 106.61ms. Allocated memory is still 645.9MB. Free memory was 445.3MB in the beginning and 428.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:58:23,099 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.19ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.78ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 93.8MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.85ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.66ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1037.56ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 61.4MB in the end (delta: 25.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * TraceAbstraction took 64625.72ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 60.6MB in the beginning and 445.3MB in the end (delta: -384.6MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. * Witness Printer took 106.61ms. Allocated memory is still 645.9MB. Free memory was 445.3MB in the beginning and 428.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 424]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 424]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 431]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 431]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 430]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 430]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 417]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 417]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 458]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 458]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 457]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 457]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 411]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 411]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 470]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 470]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 469]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 469]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 405]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 405]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 482]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 482]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 481]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 481]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 399]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 399]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 494]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 494]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 493]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 493]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 393]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 393]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 506]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 506]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 505]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 505]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 387]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 387]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 530]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 530]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 529]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 529]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 375]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 375]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 542]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 542]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 541]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 541]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 369]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 369]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 363]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 363]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 357]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 357]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 345]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 345]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 339]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 339]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 333]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 333]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 327]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 327]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 638]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 638]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 321]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 321]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 650]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 650]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 315]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 315]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 662]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 662]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 309]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 309]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 674]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 674]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 303]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 303]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 686]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 686]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 685]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 685]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 297]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 297]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 697]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 697]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 291]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 291]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 710]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 710]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 709]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 709]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 285]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 285]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 722]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 722]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 721]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 721]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 279]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 279]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 734]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 734]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 733]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 733]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 746]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 746]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 745]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 745]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 267]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 267]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 758]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 758]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 757]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 757]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 261]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 261]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 769]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 769]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 255]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 255]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 781]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 781]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 794]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 794]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 793]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 793]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 243]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 243]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 806]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 806]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 805]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 805]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 818]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 818]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 817]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 817]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 830]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 830]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 842]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 842]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 841]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 841]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 854]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 854]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 853]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 853]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 866]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 866]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 878]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 878]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 877]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 877]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 890]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 890]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 889]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 889]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 195]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 195]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 902]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 902]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 901]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 901]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 914]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 914]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 913]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 913]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 925]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 925]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 938]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 938]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 171]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 171]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 950]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 950]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 962]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 962]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 961]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 961]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 974]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 974]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 973]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 973]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 986]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 986]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 985]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 985]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 998]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 998]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 997]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 997]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1010]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1010]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1009]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1009]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 135]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 135]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1022]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1022]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1021]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1021]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1034]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1034]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1033]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1033]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1046]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1046]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1045]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1045]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1058]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1058]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1057]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1057]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 111]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 111]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1070]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1070]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1069]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1069]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1082]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1082]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1081]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1081]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1094]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1094]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1093]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1093]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1141]: 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: 1154]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1154]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1153]: 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: 1166]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1166]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1165]: 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: 1178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1177]: 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: 1190]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1190]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1189]: 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: 1202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1201]: 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: 1214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1213]: 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: 1226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1225]: 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: 1238]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1238]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1237]: 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: 1250]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1250]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1249]: 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, 959 locations, 1095 edges, 408 error locations. Started 1 CEGAR loops. OverallTime: 64.6s, OverallIterations: 74, TraceHistogramMax: 62, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46911 SdHoareTripleChecker+Valid, 31.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46911 mSDsluCounter, 76378 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45668 mSDsCounter, 5384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94516 IncrementalHoareTripleChecker+Invalid, 99900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5384 mSolverCounterUnsat, 30710 mSDtfsCounter, 94516 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3183 GetRequests, 1566 SyntacticMatches, 0 SemanticMatches, 1617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2137occurred in iteration=8, InterpolantAutomatonStates: 1765, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 74 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 12460 NumberOfCodeBlocks, 12454 NumberOfCodeBlocksAsserted, 138 NumberOfCheckSat, 13134 ConstructedInterpolants, 0 QuantifiedInterpolants, 36368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1234 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 78 InterpolantComputations, 72 PerfectInterpolantSequences, 11346/15522 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 408 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:58:23,121 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