./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/insertionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:24:19,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:24:19,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-04-30 10:24:19,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:24:19,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:24:19,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:24:19,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:24:19,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:24:19,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:24:19,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:24:19,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:24:19,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:24:19,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:24:19,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:24:19,279 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:24:19,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:24:19,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:24:19,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:24:19,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:24:19,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:24:19,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:24:19,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:24:19,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:24:19,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:24:19,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:24:19,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:24:19,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:24:19,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:24:19,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:24:19,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:24:19,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:24:19,283 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c [2025-04-30 10:24:19,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:24:19,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:24:19,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:24:19,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:24:19,530 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:24:19,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/insertionsort-alloca-2.i [2025-04-30 10:24:20,849 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adcca2f8/4f030ca3048945f89e8c4df7cd804879/FLAGc6a4a0d5e [2025-04-30 10:24:21,060 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:24:21,060 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/insertionsort-alloca-2.i [2025-04-30 10:24:21,068 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adcca2f8/4f030ca3048945f89e8c4df7cd804879/FLAGc6a4a0d5e [2025-04-30 10:24:21,899 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adcca2f8/4f030ca3048945f89e8c4df7cd804879 [2025-04-30 10:24:21,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:24:21,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:24:21,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:24:21,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:24:21,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:24:21,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:24:21" (1/1) ... [2025-04-30 10:24:21,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122dc412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:21, skipping insertion in model container [2025-04-30 10:24:21,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:24:21" (1/1) ... [2025-04-30 10:24:21,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:24:22,182 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:24:22,191 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:24:22,258 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:24:22,282 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:24:22,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22 WrapperNode [2025-04-30 10:24:22,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:24:22,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:24:22,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:24:22,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:24:22,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,317 INFO L138 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-04-30 10:24:22,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:24:22,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:24:22,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:24:22,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:24:22,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,340 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-04-30 10:24:22,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:24:22,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:24:22,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:24:22,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:24:22,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (1/1) ... [2025-04-30 10:24:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:24:22,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:22,387 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-30 10:24:22,392 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-30 10:24:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:24:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:24:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:24:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:24:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:24:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:24:22,487 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:24:22,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:24:22,587 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-30 10:24:22,587 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:24:22,594 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:24:22,594 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:24:22,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:24:22 BoogieIcfgContainer [2025-04-30 10:24:22,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:24:22,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:24:22,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:24:22,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:24:22,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:24:21" (1/3) ... [2025-04-30 10:24:22,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aea8695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:24:22, skipping insertion in model container [2025-04-30 10:24:22,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:24:22" (2/3) ... [2025-04-30 10:24:22,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aea8695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:24:22, skipping insertion in model container [2025-04-30 10:24:22,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:24:22" (3/3) ... [2025-04-30 10:24:22,603 INFO L128 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca-2.i [2025-04-30 10:24:22,615 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:24:22,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG insertionsort-alloca-2.i that has 1 procedures, 29 locations, 33 edges, 1 initial locations, 2 loop locations, and 8 error locations. [2025-04-30 10:24:22,656 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:24:22,665 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;@35f41228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:24:22,665 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-30 10:24:22,669 INFO L278 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:22,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:24:22,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:22,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:22,673 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:22,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash 119414604, now seen corresponding path program 1 times [2025-04-30 10:24:22,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:22,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632023802] [2025-04-30 10:24:22,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:22,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:24:22,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:24:22,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:22,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:22,873 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-30 10:24:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:22,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632023802] [2025-04-30 10:24:22,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632023802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:22,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:24:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712586163] [2025-04-30 10:24:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:22,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:24:22,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:22,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:24:22,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:24:22,895 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-30 10:24:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:22,982 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-04-30 10:24:22,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:24:22,984 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-30 10:24:22,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:22,990 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:24:22,990 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:24:22,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:24:22,995 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:22,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:24:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-04-30 10:24:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-04-30 10:24:23,024 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 8 [2025-04-30 10:24:23,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,024 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-04-30 10:24:23,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-30 10:24:23,024 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-04-30 10:24:23,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:24:23,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:24:23,025 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:23,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash -593114518, now seen corresponding path program 1 times [2025-04-30 10:24:23,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424106234] [2025-04-30 10:24:23,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:24:23,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:24:23,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,093 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-30 10:24:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:23,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424106234] [2025-04-30 10:24:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424106234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:24:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425051130] [2025-04-30 10:24:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:23,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:24:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:23,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:24:23,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:24:23,097 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,160 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-04-30 10:24:23,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:24:23,160 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:24:23,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,161 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:24:23,161 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:24:23,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:24:23,162 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 58 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:24:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-04-30 10:24:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2025-04-30 10:24:23,170 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 9 [2025-04-30 10:24:23,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,170 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-04-30 10:24:23,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,170 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2025-04-30 10:24:23,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:24:23,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:24:23,171 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:23,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1253390741, now seen corresponding path program 1 times [2025-04-30 10:24:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660316905] [2025-04-30 10:24:23,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:24:23,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:24:23,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,212 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-30 10:24:23,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:23,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660316905] [2025-04-30 10:24:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660316905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:24:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228995187] [2025-04-30 10:24:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:23,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:24:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:23,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:24:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:24:23,214 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,227 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2025-04-30 10:24:23,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:24:23,227 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:24:23,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,229 INFO L225 Difference]: With dead ends: 94 [2025-04-30 10:24:23,229 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:24:23,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:24:23,231 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:24:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-04-30 10:24:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.511111111111111) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-30 10:24:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2025-04-30 10:24:23,238 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 11 [2025-04-30 10:24:23,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,238 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2025-04-30 10:24:23,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,238 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2025-04-30 10:24:23,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:24:23,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:24:23,239 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:23,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 648202257, now seen corresponding path program 1 times [2025-04-30 10:24:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416169748] [2025-04-30 10:24:23,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:24:23,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:24:23,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,321 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-30 10:24:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:23,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416169748] [2025-04-30 10:24:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416169748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:24:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047668069] [2025-04-30 10:24:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:23,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:24:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:23,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:24:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:24:23,322 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-30 10:24:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,360 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2025-04-30 10:24:23,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:24:23,362 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-30 10:24:23,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,362 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:24:23,362 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:24:23,362 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-30 10:24:23,363 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,363 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:24:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-04-30 10:24:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-04-30 10:24:23,369 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 13 [2025-04-30 10:24:23,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,369 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-04-30 10:24:23,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-30 10:24:23,369 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-04-30 10:24:23,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:24:23,370 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:24:23,370 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:23,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1380566442, now seen corresponding path program 1 times [2025-04-30 10:24:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693151140] [2025-04-30 10:24:23,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:24:23,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:24:23,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,467 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-30 10:24:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:23,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693151140] [2025-04-30 10:24:23,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693151140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:23,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:24:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62469178] [2025-04-30 10:24:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:23,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:24:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:23,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:24:23,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:24:23,468 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-30 10:24:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,544 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-04-30 10:24:23,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:24:23,545 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-04-30 10:24:23,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,545 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:24:23,545 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:24:23,546 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:24:23,546 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,546 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:24:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-04-30 10:24:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-04-30 10:24:23,550 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 14 [2025-04-30 10:24:23,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,550 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-04-30 10:24:23,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-30 10:24:23,550 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-04-30 10:24:23,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:24:23,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:24:23,551 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:23,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1128271021, now seen corresponding path program 1 times [2025-04-30 10:24:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590443015] [2025-04-30 10:24:23,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:24:23,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:24:23,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:23,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590443015] [2025-04-30 10:24:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590443015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:24:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537467367] [2025-04-30 10:24:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:23,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:24:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:24:23,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:24:23,620 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,683 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-04-30 10:24:23,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:24:23,684 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:24:23,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,684 INFO L225 Difference]: With dead ends: 81 [2025-04-30 10:24:23,684 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:24:23,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:24:23,685 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:24:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-04-30 10:24:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-04-30 10:24:23,688 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 16 [2025-04-30 10:24:23,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,688 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-04-30 10:24:23,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,688 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-04-30 10:24:23,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:24:23,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:24:23,689 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:23,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash 151999643, now seen corresponding path program 1 times [2025-04-30 10:24:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628689077] [2025-04-30 10:24:23,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:24:23,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:24:23,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:23,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628689077] [2025-04-30 10:24:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628689077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:23,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893895913] [2025-04-30 10:24:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:23,767 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-30 10:24:23,768 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-30 10:24:23,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:24:23,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:24:23,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:23,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:23,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:24:23,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:24:23,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:24:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893895913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:23,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:24:23,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-30 10:24:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739248748] [2025-04-30 10:24:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:23,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:24:23,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:23,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:24:23,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:24:23,863 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-30 10:24:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,898 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-04-30 10:24:23,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:24:23,899 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), 0 states have call successors, (0), 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 17 [2025-04-30 10:24:23,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,899 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:24:23,899 INFO L226 Difference]: Without dead ends: 50 [2025-04-30 10:24:23,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:24:23,901 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-30 10:24:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-04-30 10:24:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.302325581395349) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2025-04-30 10:24:23,906 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 17 [2025-04-30 10:24:23,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,906 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-04-30 10:24:23,906 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), 0 states have call successors, (0), 0 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-30 10:24:23,906 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2025-04-30 10:24:23,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:24:23,907 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,913 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-30 10:24:24,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:24,108 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:24,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1890849367, now seen corresponding path program 1 times [2025-04-30 10:24:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:24,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503704896] [2025-04-30 10:24:24,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:24,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:24:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:24:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:24,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:24,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503704896] [2025-04-30 10:24:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503704896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:24,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24156474] [2025-04-30 10:24:24,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:24,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:24,153 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-30 10:24:24,154 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-30 10:24:24,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:24:24,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:24:24,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:24,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:24,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:24:24,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:24:24,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:24:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24156474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:24:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-04-30 10:24:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793587793] [2025-04-30 10:24:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:24,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:24:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:24,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:24:24,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:24:24,240 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:24,251 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2025-04-30 10:24:24,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:24:24,251 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:24:24,251 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:24,251 INFO L225 Difference]: With dead ends: 91 [2025-04-30 10:24:24,251 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:24:24,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:24:24,252 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:24,252 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:24:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-04-30 10:24:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-04-30 10:24:24,271 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2025-04-30 10:24:24,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:24,272 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-04-30 10:24:24,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:24,272 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-04-30 10:24:24,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:24:24,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:24,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:24,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:24:24,472 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,SelfDestructingSolverStorable7 [2025-04-30 10:24:24,473 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:24,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash 869781013, now seen corresponding path program 1 times [2025-04-30 10:24:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:24,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817840644] [2025-04-30 10:24:24,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:24:24,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:24:24,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:24,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:24,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817840644] [2025-04-30 10:24:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817840644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:24,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669975417] [2025-04-30 10:24:24,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:24,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:24,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:24,527 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-30 10:24:24,528 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-30 10:24:24,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:24:24,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:24:24,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:24,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:24,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:24:24,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:24,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669975417] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:24,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-30 10:24:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944715644] [2025-04-30 10:24:24,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:24,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:24:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:24,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:24:24,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:24:24,635 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 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-30 10:24:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:24,724 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2025-04-30 10:24:24,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:24:24,724 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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 18 [2025-04-30 10:24:24,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:24,725 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:24:24,725 INFO L226 Difference]: Without dead ends: 70 [2025-04-30 10:24:24,725 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:24:24,726 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 99 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:24,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 46 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-30 10:24:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2025-04-30 10:24:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-04-30 10:24:24,729 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 18 [2025-04-30 10:24:24,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:24,730 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-04-30 10:24:24,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 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-30 10:24:24,730 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-04-30 10:24:24,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:24:24,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:24,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:24,736 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-30 10:24:24,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:24,931 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:24,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1209715083, now seen corresponding path program 1 times [2025-04-30 10:24:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:24,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721201711] [2025-04-30 10:24:24,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:24,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:24:24,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:24:24,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:24,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:24:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:24,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721201711] [2025-04-30 10:24:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721201711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:24:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:24:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:24:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312124171] [2025-04-30 10:24:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:24:24,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:24:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:24,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:24:24,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:24:24,970 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-30 10:24:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:24,990 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-04-30 10:24:24,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:24:24,993 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 23 [2025-04-30 10:24:24,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:24,993 INFO L225 Difference]: With dead ends: 65 [2025-04-30 10:24:24,993 INFO L226 Difference]: Without dead ends: 64 [2025-04-30 10:24:24,993 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-30 10:24:24,993 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:24,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-30 10:24:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-04-30 10:24:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-04-30 10:24:24,997 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2025-04-30 10:24:24,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:24,997 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-04-30 10:24:24,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-30 10:24:24,997 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-04-30 10:24:24,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:24:24,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:24,998 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-04-30 10:24:24,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:24:24,998 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:24:24,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash -606934213, now seen corresponding path program 1 times [2025-04-30 10:24:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:24,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719075813] [2025-04-30 10:24:24,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:25,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:24:25,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:24:25,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:25,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:24:25,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:25,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719075813] [2025-04-30 10:24:25,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719075813] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:25,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901426751] [2025-04-30 10:24:25,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:24:25,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:25,057 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-30 10:24:25,059 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-30 10:24:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:24:25,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:24:25,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:24:25,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:25,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:24:25,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:25,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901426751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:25,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-30 10:24:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453468752] [2025-04-30 10:24:25,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:25,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:24:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:25,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:24:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:24:25,227 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-30 10:24:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:25,309 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-04-30 10:24:25,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:24:25,309 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:24:25,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:25,311 INFO L225 Difference]: With dead ends: 102 [2025-04-30 10:24:25,311 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:24:25,311 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:24:25,312 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 138 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:25,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 91 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:24:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:24:25,313 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-30 10:24:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:24:25,313 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-04-30 10:24:25,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:25,314 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:24:25,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-30 10:24:25,314 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:24:25,314 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:24:25,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-04-30 10:24:25,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-04-30 10:24:25,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-04-30 10:24:25,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-04-30 10:24:25,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-04-30 10:24:25,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-04-30 10:24:25,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-04-30 10:24:25,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-04-30 10:24:25,323 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-30 10:24:25,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:25,520 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:25,521 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-30 10:24:25,603 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:24:25,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:24:25 BoogieIcfgContainer [2025-04-30 10:24:25,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:24:25,618 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:24:25,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:24:25,619 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:24:25,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:24:22" (3/4) ... [2025-04-30 10:24:25,624 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:24:25,630 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-04-30 10:24:25,630 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-30 10:24:25,630 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:24:25,630 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:24:25,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:24:25,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:24:25,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:24:25,687 INFO L158 Benchmark]: Toolchain (without parser) took 3784.97ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 89.8MB in the end (delta: 22.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: CDTParser took 1.28ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.12ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 93.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.94ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: RCFGBuilder took 236.74ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 77.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: TraceAbstraction took 3021.52ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 96.1MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:24:25,687 INFO L158 Benchmark]: Witness Printer took 67.68ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 89.8MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:24:25,688 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.12ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 93.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.94ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 236.74ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 77.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3021.52ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 96.1MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.68ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 89.8MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 33 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 191 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 51 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 692 SizeOfPredicates, 3 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 28/121 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 8 specifications checked. All of them hold - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((1 <= i) && (i <= 2147483646)) && (array_size <= 2147483647)) && (j <= 2147483648)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((1 <= i) && (array_size <= 2147483647)) && (i <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2025-04-30 10:24:25,705 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