./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.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 e33cc370136ebab299b4000c55c7977ad293f755b9b4546b900973984c423ef5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:02:19,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:02:19,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:02:19,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:02:19,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:02:19,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:02:19,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:02:19,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:02:19,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:02:19,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:02:19,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:02:19,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:02:19,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:02:19,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:02:19,685 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:02:19,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:02:19,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:02:19,685 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:02:19,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:02:19,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:19,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:19,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:19,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:02:19,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:02:19,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:02:19,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:02:19,688 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 -> e33cc370136ebab299b4000c55c7977ad293f755b9b4546b900973984c423ef5 [2025-04-29 11:02:19,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:02:19,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:02:19,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:02:19,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:02:19,919 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:02:19,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c [2025-04-29 11:02:21,195 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecb4f3d3/6493d15bed3348419aac1332ef3ab178/FLAGf0eb8bb2c [2025-04-29 11:02:21,406 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:02:21,406 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c [2025-04-29 11:02:21,407 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:21,411 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecb4f3d3/6493d15bed3348419aac1332ef3ab178/FLAGf0eb8bb2c [2025-04-29 11:02:22,246 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecb4f3d3/6493d15bed3348419aac1332ef3ab178 [2025-04-29 11:02:22,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:22,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:22,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:22,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:22,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:22,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6851e859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22, skipping insertion in model container [2025-04-29 11:02:22,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:22,412 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:22,418 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:22,445 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:22,455 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:22,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22 WrapperNode [2025-04-29 11:02:22,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:22,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:22,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:22,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:22,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,484 INFO L138 Inliner]: procedures = 6, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-04-29 11:02:22,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:22,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:22,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:22,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:22,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,506 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 11:02:22,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:22,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:22,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:22,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:22,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (1/1) ... [2025-04-29 11:02:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:22,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:22,550 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-04-29 11:02:22,553 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-04-29 11:02:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 11:02:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 11:02:22,606 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:22,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:22,743 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:22,743 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:22,752 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:22,754 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:02:22,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:22 BoogieIcfgContainer [2025-04-29 11:02:22,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:22,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:22,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:22,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:22,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:22" (1/3) ... [2025-04-29 11:02:22,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c04a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:22, skipping insertion in model container [2025-04-29 11:02:22,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:22" (2/3) ... [2025-04-29 11:02:22,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c04a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:22, skipping insertion in model container [2025-04-29 11:02:22,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:22" (3/3) ... [2025-04-29 11:02:22,761 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.c [2025-04-29 11:02:22,771 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:22,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex1-poly.c that has 2 procedures, 65 locations, 82 edges, 1 initial locations, 2 loop locations, and 22 error locations. [2025-04-29 11:02:22,810 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:22,820 INFO L340 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;@485371fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:22,820 INFO L341 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-04-29 11:02:22,823 INFO L278 IsEmpty]: Start isEmpty. Operand has 65 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 56 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 11:02:22,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:02:22,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:22,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:02:22,827 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:22,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash 28694820, now seen corresponding path program 1 times [2025-04-29 11:02:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:22,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022419643] [2025-04-29 11:02:22,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:22,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:02:22,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:02:22,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:22,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:22,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022419643] [2025-04-29 11:02:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022419643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:22,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:22,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000873608] [2025-04-29 11:02:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:22,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:22,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:22,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:22,962 INFO L87 Difference]: Start difference. First operand has 65 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 56 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-04-29 11:02:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,099 INFO L93 Difference]: Finished difference Result 167 states and 225 transitions. [2025-04-29 11:02:23,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:23,101 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-04-29 11:02:23,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,105 INFO L225 Difference]: With dead ends: 167 [2025-04-29 11:02:23,105 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:02:23,108 INFO L436 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-04-29 11:02:23,111 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 129 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:02:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2025-04-29 11:02:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 67 states have internal predecessors, (76), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-04-29 11:02:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2025-04-29 11:02:23,149 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 5 [2025-04-29 11:02:23,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,149 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2025-04-29 11:02:23,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-04-29 11:02:23,149 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2025-04-29 11:02:23,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:02:23,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:02:23,150 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 889539464, now seen corresponding path program 1 times [2025-04-29 11:02:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940440124] [2025-04-29 11:02:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:02:23,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:02:23,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940440124] [2025-04-29 11:02:23,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940440124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:23,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:23,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556655821] [2025-04-29 11:02:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:23,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:23,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:23,181 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,261 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2025-04-29 11:02:23,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:23,261 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-29 11:02:23,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,263 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:02:23,264 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:02:23,264 INFO L436 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-04-29 11:02:23,265 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 140 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:02:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2025-04-29 11:02:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 73 states have internal predecessors, (84), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-04-29 11:02:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2025-04-29 11:02:23,278 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 6 [2025-04-29 11:02:23,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,279 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2025-04-29 11:02:23,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,279 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2025-04-29 11:02:23,279 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:02:23,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:02:23,279 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1805919654, now seen corresponding path program 1 times [2025-04-29 11:02:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566271654] [2025-04-29 11:02:23,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:02:23,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:02:23,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:23,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566271654] [2025-04-29 11:02:23,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566271654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:23,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753688904] [2025-04-29 11:02:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:23,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:23,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:23,304 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,352 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2025-04-29 11:02:23,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:23,352 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-04-29 11:02:23,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,353 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:02:23,353 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:02:23,353 INFO L436 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-04-29 11:02:23,354 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 54 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:02:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:02:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 69 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-04-29 11:02:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2025-04-29 11:02:23,362 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 7 [2025-04-29 11:02:23,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,362 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2025-04-29 11:02:23,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,362 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2025-04-29 11:02:23,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:02:23,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:02:23,363 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,363 INFO L85 PathProgramCache]: Analyzing trace with hash 148934474, now seen corresponding path program 1 times [2025-04-29 11:02:23,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254404943] [2025-04-29 11:02:23,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:02:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:02:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254404943] [2025-04-29 11:02:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254404943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:23,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125840583] [2025-04-29 11:02:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:23,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:23,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:23,395 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,427 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2025-04-29 11:02:23,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:23,427 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-29 11:02:23,427 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,428 INFO L225 Difference]: With dead ends: 149 [2025-04-29 11:02:23,428 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:02:23,428 INFO L436 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-04-29 11:02:23,429 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:02:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-04-29 11:02:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 71 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-04-29 11:02:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2025-04-29 11:02:23,436 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 8 [2025-04-29 11:02:23,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,436 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2025-04-29 11:02:23,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,436 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2025-04-29 11:02:23,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:02:23,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:02:23,436 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -539346509, now seen corresponding path program 1 times [2025-04-29 11:02:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435322144] [2025-04-29 11:02:23,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:02:23,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:02:23,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435322144] [2025-04-29 11:02:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435322144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:23,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:23,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:02:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468972195] [2025-04-29 11:02:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:02:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:02:23,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:02:23,485 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:02:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,588 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2025-04-29 11:02:23,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:23,588 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-29 11:02:23,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,589 INFO L225 Difference]: With dead ends: 121 [2025-04-29 11:02:23,589 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:02:23,590 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:02:23,590 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,590 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 147 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:02:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2025-04-29 11:02:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 82 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-04-29 11:02:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2025-04-29 11:02:23,609 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 15 [2025-04-29 11:02:23,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,609 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2025-04-29 11:02:23,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:02:23,609 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2025-04-29 11:02:23,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:02:23,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:02:23,610 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1665073616, now seen corresponding path program 1 times [2025-04-29 11:02:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611761033] [2025-04-29 11:02:23,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:02:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:02:23,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:02:23,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611761033] [2025-04-29 11:02:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611761033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:23,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821889328] [2025-04-29 11:02:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:23,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:23,680 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:02:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,737 INFO L93 Difference]: Finished difference Result 179 states and 225 transitions. [2025-04-29 11:02:23,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:23,739 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 11:02:23,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,740 INFO L225 Difference]: With dead ends: 179 [2025-04-29 11:02:23,741 INFO L226 Difference]: Without dead ends: 114 [2025-04-29 11:02:23,741 INFO L436 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-04-29 11:02:23,743 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-29 11:02:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2025-04-29 11:02:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 84 states have internal predecessors, (98), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-04-29 11:02:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2025-04-29 11:02:23,753 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 24 [2025-04-29 11:02:23,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,753 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2025-04-29 11:02:23,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:02:23,753 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2025-04-29 11:02:23,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:02:23,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:02:23,755 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -227683274, now seen corresponding path program 1 times [2025-04-29 11:02:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458595931] [2025-04-29 11:02:23,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:02:23,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:02:23,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:02:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458595931] [2025-04-29 11:02:23,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458595931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:23,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:23,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394497901] [2025-04-29 11:02:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:23,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:23,808 INFO L87 Difference]: Start difference. First operand 108 states and 142 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:02:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,859 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2025-04-29 11:02:23,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:23,859 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2025-04-29 11:02:23,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,860 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:02:23,860 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:02:23,860 INFO L436 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-04-29 11:02:23,861 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:02:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-29 11:02:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 80 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-04-29 11:02:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions. [2025-04-29 11:02:23,873 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 37 [2025-04-29 11:02:23,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,875 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 133 transitions. [2025-04-29 11:02:23,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:02:23,875 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2025-04-29 11:02:23,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:02:23,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:23,877 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:02:23,877 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:23,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash -982149947, now seen corresponding path program 1 times [2025-04-29 11:02:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:23,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798558103] [2025-04-29 11:02:23,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:23,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:02:23,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:02:23,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:23,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:02:23,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:23,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798558103] [2025-04-29 11:02:23,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798558103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:23,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233612414] [2025-04-29 11:02:23,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:23,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:23,990 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-04-29 11:02:23,991 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-04-29 11:02:24,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:02:24,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:02:24,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:24,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:24,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:24,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:02:24,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:02:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233612414] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:24,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:24,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-29 11:02:24,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522596974] [2025-04-29 11:02:24,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:24,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:02:24,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:24,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:02:24,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:24,207 INFO L87 Difference]: Start difference. First operand 104 states and 133 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-04-29 11:02:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:24,380 INFO L93 Difference]: Finished difference Result 187 states and 249 transitions. [2025-04-29 11:02:24,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:02:24,381 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2025-04-29 11:02:24,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:24,382 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:02:24,382 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:02:24,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:24,383 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 75 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:24,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 154 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:02:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 148. [2025-04-29 11:02:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 114 states have internal predecessors, (128), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-04-29 11:02:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2025-04-29 11:02:24,399 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 46 [2025-04-29 11:02:24,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:24,400 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2025-04-29 11:02:24,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-04-29 11:02:24,400 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2025-04-29 11:02:24,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 11:02:24,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:24,401 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:24,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:02:24,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:24,601 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:24,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -463209730, now seen corresponding path program 1 times [2025-04-29 11:02:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:24,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662940978] [2025-04-29 11:02:24,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:24,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:02:24,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:02:24,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:24,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-29 11:02:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:24,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662940978] [2025-04-29 11:02:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662940978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:24,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753450078] [2025-04-29 11:02:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:24,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:24,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:24,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:24,642 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 11:02:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:24,700 INFO L93 Difference]: Finished difference Result 148 states and 192 transitions. [2025-04-29 11:02:24,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:24,700 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2025-04-29 11:02:24,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:24,701 INFO L225 Difference]: With dead ends: 148 [2025-04-29 11:02:24,701 INFO L226 Difference]: Without dead ends: 145 [2025-04-29 11:02:24,702 INFO L436 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-04-29 11:02:24,702 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:24,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-04-29 11:02:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-04-29 11:02:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.196078431372549) internal successors, (122), 111 states have internal predecessors, (122), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-04-29 11:02:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2025-04-29 11:02:24,713 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 55 [2025-04-29 11:02:24,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:24,713 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2025-04-29 11:02:24,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 11:02:24,713 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2025-04-29 11:02:24,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-04-29 11:02:24,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:24,714 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:24,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:02:24,714 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:24,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1212514700, now seen corresponding path program 1 times [2025-04-29 11:02:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:24,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629442410] [2025-04-29 11:02:24,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:24,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-29 11:02:24,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-29 11:02:24,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:24,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-04-29 11:02:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:24,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629442410] [2025-04-29 11:02:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629442410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:24,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360296449] [2025-04-29 11:02:24,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:24,985 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-04-29 11:02:24,986 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-04-29 11:02:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-29 11:02:25,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-29 11:02:25,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:25,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:02:25,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-04-29 11:02:25,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-04-29 11:02:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360296449] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:25,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2025-04-29 11:02:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651733299] [2025-04-29 11:02:25,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:25,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:02:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:25,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:02:25,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:02:25,821 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 27 states have internal predecessors, (105), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2025-04-29 11:02:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:26,128 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2025-04-29 11:02:26,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:02:26,129 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 27 states have internal predecessors, (105), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 95 [2025-04-29 11:02:26,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:26,130 INFO L225 Difference]: With dead ends: 145 [2025-04-29 11:02:26,130 INFO L226 Difference]: Without dead ends: 138 [2025-04-29 11:02:26,130 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:02:26,131 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:26,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 233 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:02:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-29 11:02:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2025-04-29 11:02:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 84 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:02:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2025-04-29 11:02:26,140 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 95 [2025-04-29 11:02:26,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:26,141 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2025-04-29 11:02:26,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 27 states have internal predecessors, (105), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2025-04-29 11:02:26,141 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2025-04-29 11:02:26,142 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-04-29 11:02:26,142 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:26,142 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:26,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:26,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:02:26,343 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:26,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1066749874, now seen corresponding path program 1 times [2025-04-29 11:02:26,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:26,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829451352] [2025-04-29 11:02:26,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-29 11:02:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-29 11:02:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-04-29 11:02:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:26,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829451352] [2025-04-29 11:02:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829451352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:02:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143803803] [2025-04-29 11:02:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:26,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:26,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:26,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:26,476 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-04-29 11:02:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:26,578 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2025-04-29 11:02:26,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:02:26,578 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 96 [2025-04-29 11:02:26,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:26,579 INFO L225 Difference]: With dead ends: 151 [2025-04-29 11:02:26,579 INFO L226 Difference]: Without dead ends: 149 [2025-04-29 11:02:26,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:26,580 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:26,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-04-29 11:02:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-04-29 11:02:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.072072072072072) internal successors, (119), 113 states have internal predecessors, (119), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-04-29 11:02:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2025-04-29 11:02:26,608 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 96 [2025-04-29 11:02:26,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:26,608 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2025-04-29 11:02:26,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-04-29 11:02:26,608 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2025-04-29 11:02:26,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-04-29 11:02:26,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:26,609 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-04-29 11:02:26,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:02:26,610 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:26,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1831527731, now seen corresponding path program 2 times [2025-04-29 11:02:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:26,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273265494] [2025-04-29 11:02:26,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:26,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-04-29 11:02:26,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-04-29 11:02:26,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:26,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-04-29 11:02:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:26,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273265494] [2025-04-29 11:02:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273265494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:26,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029187722] [2025-04-29 11:02:26,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:26,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:26,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:26,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:26,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:02:26,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-04-29 11:02:26,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-04-29 11:02:26,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:26,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:02:26,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-04-29 11:02:26,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029187722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-04-29 11:02:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404469176] [2025-04-29 11:02:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:26,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:02:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:02:26,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:02:26,928 INFO L87 Difference]: Start difference. First operand 149 states and 187 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-04-29 11:02:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:26,969 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2025-04-29 11:02:26,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:26,970 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 139 [2025-04-29 11:02:26,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:26,971 INFO L225 Difference]: With dead ends: 219 [2025-04-29 11:02:26,971 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:02:26,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:02:26,971 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:26,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:02:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-29 11:02:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-04-29 11:02:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2025-04-29 11:02:26,980 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 139 [2025-04-29 11:02:26,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:26,980 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2025-04-29 11:02:26,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-04-29 11:02:26,980 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2025-04-29 11:02:26,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-04-29 11:02:26,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:26,981 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:26,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:27,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:27,182 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-04-29 11:02:27,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1495715748, now seen corresponding path program 1 times [2025-04-29 11:02:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:27,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105197503] [2025-04-29 11:02:27,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:27,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:27,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-04-29 11:02:27,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-04-29 11:02:27,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:27,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2025-04-29 11:02:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:27,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105197503] [2025-04-29 11:02:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105197503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:27,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830008668] [2025-04-29 11:02:27,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:27,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:27,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:02:27,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-04-29 11:02:27,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-04-29 11:02:27,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:27,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:27,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:02:27,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-04-29 11:02:28,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-04-29 11:02:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830008668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:28,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 17] total 42 [2025-04-29 11:02:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15884096] [2025-04-29 11:02:28,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:28,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:02:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:28,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:02:28,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:02:28,874 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 43 states, 42 states have (on average 4.738095238095238) internal successors, (199), 43 states have internal predecessors, (199), 12 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) [2025-04-29 11:02:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:29,338 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2025-04-29 11:02:29,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:02:29,339 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.738095238095238) internal successors, (199), 43 states have internal predecessors, (199), 12 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) Word has length 192 [2025-04-29 11:02:29,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:29,339 INFO L225 Difference]: With dead ends: 153 [2025-04-29 11:02:29,340 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:02:29,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=636, Invalid=2016, Unknown=0, NotChecked=0, Total=2652 [2025-04-29 11:02:29,341 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:29,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 269 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:02:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:02:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:02:29,342 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-04-29 11:02:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:02:29,342 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2025-04-29 11:02:29,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:29,342 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:02:29,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.738095238095238) internal successors, (199), 43 states have internal predecessors, (199), 12 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) [2025-04-29 11:02:29,343 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:02:29,343 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-04-29 11:02:29,345 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-04-29 11:02:29,346 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-04-29 11:02:29,346 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-04-29 11:02:29,346 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-04-29 11:02:29,346 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-04-29 11:02:29,346 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-04-29 11:02:29,346 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-04-29 11:02:29,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:02:29,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:29,548 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:29,550 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:02:29,861 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:02:29,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:02:29 BoogieIcfgContainer [2025-04-29 11:02:29,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:02:29,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:02:29,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:02:29,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:02:29,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:22" (3/4) ... [2025-04-29 11:02:29,880 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:02:29,884 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-04-29 11:02:29,887 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-29 11:02:29,888 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:02:29,888 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:02:29,954 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:02:29,954 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:02:29,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:02:29,955 INFO L158 Benchmark]: Toolchain (without parser) took 7706.43ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 121.9MB in the beginning and 137.3MB in the end (delta: -15.4MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-04-29 11:02:29,955 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:29,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.21ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:29,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.70ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:29,956 INFO L158 Benchmark]: Boogie Preprocessor took 37.43ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:29,956 INFO L158 Benchmark]: RCFGBuilder took 229.80ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 91.8MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:29,956 INFO L158 Benchmark]: TraceAbstraction took 7120.34ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 91.2MB in the beginning and 143.3MB in the end (delta: -52.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-04-29 11:02:29,957 INFO L158 Benchmark]: Witness Printer took 77.98ms. Allocated memory is still 243.3MB. Free memory was 143.3MB in the beginning and 137.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:29,958 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 184.5MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.21ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.70ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.43ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 229.80ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 91.8MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7120.34ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 91.2MB in the beginning and 143.3MB in the end (delta: -52.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 77.98ms. Allocated memory is still 243.3MB. Free memory was 143.3MB in the beginning and 137.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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 2 procedures, 65 locations, 82 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 13, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 1705 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1154 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1971 IncrementalHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 551 mSDtfsCounter, 1971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 889 GetRequests, 767 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=11, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1197 NumberOfCodeBlocks, 1197 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1510 ConstructedInterpolants, 0 QuantifiedInterpolants, 6074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 5848/6358 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 22 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((i == 0) || ((1 <= i) && (i <= 2147483647))) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((2 == j) && (i == 1)) || (((2 == j) && (2 <= i)) && (i <= 1073741822))) || ((i == 0) && (j == 0))) || (((j == 4) && (2 <= i)) && (i <= 1073741823))) || (((i <= 1073741821) && (1 <= i)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:02:29,975 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