./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:20:33,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:20:33,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:20:33,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:20:33,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:20:33,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:20:33,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:20:33,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:20:33,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:20:33,918 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:20:33,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:20:33,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:20:33,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:20:33,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:20:33,919 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:20:33,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:20:33,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:20:33,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:20:33,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:20:33,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:20:33,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:20:33,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:20:33,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:20:33,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:20:33,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:20:33,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:20:33,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:20:33,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:20:33,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:20:33,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2025-04-30 10:20:34,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:20:34,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:20:34,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:20:34,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:20:34,153 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:20:34,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.i [2025-04-30 10:20:35,432 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b86ca2ab/ce3060c331c840f6b698d545d32770dc/FLAG64c34ad3b [2025-04-30 10:20:35,647 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:20:35,649 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.i [2025-04-30 10:20:35,656 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b86ca2ab/ce3060c331c840f6b698d545d32770dc/FLAG64c34ad3b [2025-04-30 10:20:36,482 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b86ca2ab/ce3060c331c840f6b698d545d32770dc [2025-04-30 10:20:36,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:20:36,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:20:36,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:20:36,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:20:36,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:20:36,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec20d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36, skipping insertion in model container [2025-04-30 10:20:36,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:20:36,638 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:20:36,645 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:20:36,663 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:20:36,674 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:20:36,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36 WrapperNode [2025-04-30 10:20:36,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:20:36,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:20:36,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:20:36,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:20:36,680 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:20:36" (1/1) ... [2025-04-30 10:20:36,687 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:20:36" (1/1) ... [2025-04-30 10:20:36,698 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-04-30 10:20:36,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:20:36,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:20:36,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:20:36,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:20:36,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,715 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:20:36,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:20:36,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:20:36,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:20:36,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:20:36,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (1/1) ... [2025-04-30 10:20:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:20:36,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:36,759 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:20:36,763 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:20:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:20:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:20:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:20:36,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:20:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-30 10:20:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-30 10:20:36,823 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:20:36,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:20:36,952 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-04-30 10:20:36,952 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:20:36,963 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:20:36,963 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:20:36,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:20:36 BoogieIcfgContainer [2025-04-30 10:20:36,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:20:36,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:20:36,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:20:36,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:20:36,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:20:36" (1/3) ... [2025-04-30 10:20:36,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46725fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:20:36, skipping insertion in model container [2025-04-30 10:20:36,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:20:36" (2/3) ... [2025-04-30 10:20:36,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46725fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:20:36, skipping insertion in model container [2025-04-30 10:20:36,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:20:36" (3/3) ... [2025-04-30 10:20:36,972 INFO L128 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2025-04-30 10:20:36,984 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:20:36,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hh2012-ex3.i that has 2 procedures, 46 locations, 64 edges, 1 initial locations, 2 loop locations, and 12 error locations. [2025-04-30 10:20:37,029 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:20:37,040 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;@5716e046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:20:37,040 INFO L341 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-04-30 10:20:37,043 INFO L278 IsEmpty]: Start isEmpty. Operand has 46 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:20:37,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:20:37,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:37,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:20:37,048 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:37,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 28694820, now seen corresponding path program 1 times [2025-04-30 10:20:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:37,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106680417] [2025-04-30 10:20:37,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:37,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:20:37,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:20:37,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:37,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:37,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:20:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:37,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106680417] [2025-04-30 10:20:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106680417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:37,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:37,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689792768] [2025-04-30 10:20:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:37,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:37,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:37,232 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:20:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:37,312 INFO L93 Difference]: Finished difference Result 105 states and 149 transitions. [2025-04-30 10:20:37,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:37,313 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:20:37,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:37,317 INFO L225 Difference]: With dead ends: 105 [2025-04-30 10:20:37,317 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:20:37,319 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:20:37,321 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:37,321 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:20:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2025-04-30 10:20:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 1.608695652173913) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:20:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-04-30 10:20:37,347 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 5 [2025-04-30 10:20:37,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:37,347 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-04-30 10:20:37,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:20:37,347 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-04-30 10:20:37,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:20:37,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:37,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:37,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:20:37,348 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:37,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1805919654, now seen corresponding path program 1 times [2025-04-30 10:20:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:37,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638918222] [2025-04-30 10:20:37,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:37,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:20:37,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:20:37,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:37,405 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:20:37,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:37,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638918222] [2025-04-30 10:20:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638918222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895325057] [2025-04-30 10:20:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:37,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:37,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:37,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:37,410 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:20:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:37,455 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2025-04-30 10:20:37,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:37,455 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:20:37,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:37,456 INFO L225 Difference]: With dead ends: 89 [2025-04-30 10:20:37,456 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:20:37,457 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:20:37,457 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:37,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:20:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-04-30 10:20:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:20:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-04-30 10:20:37,464 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 7 [2025-04-30 10:20:37,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:37,464 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-04-30 10:20:37,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:20:37,465 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-04-30 10:20:37,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:20:37,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:37,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:37,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:20:37,466 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:37,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 883721606, now seen corresponding path program 1 times [2025-04-30 10:20:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:37,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127563435] [2025-04-30 10:20:37,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:37,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:20:37,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:20:37,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:37,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:20:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:37,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127563435] [2025-04-30 10:20:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127563435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:20:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635340290] [2025-04-30 10:20:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:37,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:20:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:20:37,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:20:37,560 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:20:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:37,639 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-04-30 10:20:37,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:20:37,640 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-04-30 10:20:37,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:37,641 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:20:37,641 INFO L226 Difference]: Without dead ends: 61 [2025-04-30 10:20:37,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:20:37,641 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:37,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-30 10:20:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2025-04-30 10:20:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:20:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-04-30 10:20:37,647 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2025-04-30 10:20:37,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:37,647 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-04-30 10:20:37,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:20:37,647 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-04-30 10:20:37,648 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:20:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:37,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:37,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:20:37,648 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:37,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1625566064, now seen corresponding path program 1 times [2025-04-30 10:20:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:37,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025980058] [2025-04-30 10:20:37,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:37,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:20:37,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:20:37,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:37,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:20:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:37,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025980058] [2025-04-30 10:20:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025980058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:37,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:37,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:20:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829119074] [2025-04-30 10:20:37,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:37,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:20:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:37,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:20:37,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:20:37,745 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:20:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:37,814 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2025-04-30 10:20:37,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:20:37,815 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-04-30 10:20:37,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:37,815 INFO L225 Difference]: With dead ends: 106 [2025-04-30 10:20:37,815 INFO L226 Difference]: Without dead ends: 61 [2025-04-30 10:20:37,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:20:37,816 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:37,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 111 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-30 10:20:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-04-30 10:20:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:20:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-04-30 10:20:37,824 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 20 [2025-04-30 10:20:37,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:37,824 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-04-30 10:20:37,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:20:37,824 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-04-30 10:20:37,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:20:37,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:37,827 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:37,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:20:37,827 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:37,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1649081834, now seen corresponding path program 1 times [2025-04-30 10:20:37,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:37,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968422656] [2025-04-30 10:20:37,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:37,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:37,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:20:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:20:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:37,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968422656] [2025-04-30 10:20:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968422656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:37,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165119044] [2025-04-30 10:20:37,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:37,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:37,922 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:20:37,923 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:20:37,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:20:37,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:20:37,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:37,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:20:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:38,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:20:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165119044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:20:38,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:20:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253867309] [2025-04-30 10:20:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:38,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:20:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:38,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:20:38,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:20:38,024 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:20:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:38,065 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2025-04-30 10:20:38,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:20:38,066 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2025-04-30 10:20:38,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:38,071 INFO L225 Difference]: With dead ends: 91 [2025-04-30 10:20:38,071 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:20:38,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:20:38,072 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:38,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 132 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:20:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2025-04-30 10:20:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 53 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-04-30 10:20:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-04-30 10:20:38,080 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 32 [2025-04-30 10:20:38,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:38,080 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-04-30 10:20:38,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:20:38,081 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-04-30 10:20:38,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:20:38,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:38,081 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:38,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:38,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:38,288 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:38,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash 418070742, now seen corresponding path program 1 times [2025-04-30 10:20:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:38,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9466697] [2025-04-30 10:20:38,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:38,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:20:38,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:20:38,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:38,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:38,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:38,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9466697] [2025-04-30 10:20:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9466697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:38,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526012223] [2025-04-30 10:20:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:38,359 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:20:38,361 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:20:38,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:20:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:20:38,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:38,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:38,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:20:38,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:38,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:38,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526012223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:38,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-30 10:20:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211912612] [2025-04-30 10:20:38,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:38,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:20:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:38,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:20:38,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:20:38,505 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:20:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:38,614 INFO L93 Difference]: Finished difference Result 132 states and 190 transitions. [2025-04-30 10:20:38,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:20:38,615 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 33 [2025-04-30 10:20:38,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:38,616 INFO L225 Difference]: With dead ends: 132 [2025-04-30 10:20:38,616 INFO L226 Difference]: Without dead ends: 131 [2025-04-30 10:20:38,617 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:20:38,617 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:38,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-30 10:20:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2025-04-30 10:20:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 71 states have internal predecessors, (91), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-04-30 10:20:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-04-30 10:20:38,632 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 33 [2025-04-30 10:20:38,632 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:38,632 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-04-30 10:20:38,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:20:38,632 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-04-30 10:20:38,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:20:38,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:38,633 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:38,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:38,833 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,SelfDestructingSolverStorable5 [2025-04-30 10:20:38,833 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:38,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:38,834 INFO L85 PathProgramCache]: Analyzing trace with hash 75291160, now seen corresponding path program 1 times [2025-04-30 10:20:38,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:38,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481744924] [2025-04-30 10:20:38,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:20:38,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:20:38,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:38,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:38,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481744924] [2025-04-30 10:20:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481744924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:38,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836797579] [2025-04-30 10:20:38,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:38,913 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:20:38,915 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:20:38,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:20:38,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:20:38,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:38,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:20:38,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:20:38,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:20:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836797579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:20:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:20:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319273285] [2025-04-30 10:20:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:38,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:20:38,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:38,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:20:38,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:20:38,985 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:20:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:39,043 INFO L93 Difference]: Finished difference Result 102 states and 147 transitions. [2025-04-30 10:20:39,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:20:39,043 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-04-30 10:20:39,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:39,045 INFO L225 Difference]: With dead ends: 102 [2025-04-30 10:20:39,045 INFO L226 Difference]: Without dead ends: 100 [2025-04-30 10:20:39,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:20:39,046 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:39,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 67 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-30 10:20:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-04-30 10:20:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.360655737704918) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-04-30 10:20:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-04-30 10:20:39,054 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 34 [2025-04-30 10:20:39,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:39,054 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-04-30 10:20:39,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:20:39,054 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-04-30 10:20:39,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:20:39,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:39,055 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:39,061 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:20:39,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:39,256 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:39,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1960941288, now seen corresponding path program 1 times [2025-04-30 10:20:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:39,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093099164] [2025-04-30 10:20:39,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:39,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:20:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:20:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:20:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:39,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093099164] [2025-04-30 10:20:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093099164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:39,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:39,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548172457] [2025-04-30 10:20:39,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:39,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:39,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:39,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:39,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:39,287 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:20:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:39,316 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2025-04-30 10:20:39,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:39,317 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-04-30 10:20:39,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:39,318 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:20:39,319 INFO L226 Difference]: Without dead ends: 98 [2025-04-30 10:20:39,319 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:20:39,320 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:39,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-30 10:20:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-04-30 10:20:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 68 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-04-30 10:20:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-04-30 10:20:39,332 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 35 [2025-04-30 10:20:39,332 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:39,332 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-04-30 10:20:39,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:20:39,333 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-04-30 10:20:39,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:20:39,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:39,333 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:39,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:20:39,333 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:39,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1838399550, now seen corresponding path program 1 times [2025-04-30 10:20:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:39,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281565373] [2025-04-30 10:20:39,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:39,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:20:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:20:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:20:39,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:39,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281565373] [2025-04-30 10:20:39,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281565373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:39,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443757515] [2025-04-30 10:20:39,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:39,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:39,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:39,419 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:20:39,419 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:20:39,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:20:39,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:20:39,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:39,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:20:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:20:39,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:20:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443757515] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:39,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:39,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-30 10:20:39,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774776961] [2025-04-30 10:20:39,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:39,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:20:39,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:39,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:20:39,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:20:39,584 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-04-30 10:20:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:39,699 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2025-04-30 10:20:39,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:20:39,700 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 47 [2025-04-30 10:20:39,702 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:39,703 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:20:39,703 INFO L226 Difference]: Without dead ends: 111 [2025-04-30 10:20:39,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:20:39,704 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:39,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 176 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-30 10:20:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2025-04-30 10:20:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 71 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-04-30 10:20:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2025-04-30 10:20:39,720 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 47 [2025-04-30 10:20:39,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:39,720 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2025-04-30 10:20:39,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-04-30 10:20:39,720 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2025-04-30 10:20:39,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-04-30 10:20:39,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:39,722 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:39,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:39,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:39,923 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:39,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2013563348, now seen corresponding path program 1 times [2025-04-30 10:20:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:39,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121107022] [2025-04-30 10:20:39,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:39,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:39,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-30 10:20:39,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-30 10:20:39,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:39,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-04-30 10:20:40,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:40,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121107022] [2025-04-30 10:20:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121107022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:40,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077932351] [2025-04-30 10:20:40,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:40,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:40,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:40,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:40,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:20:40,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-30 10:20:40,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-30 10:20:40,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:40,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:40,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:20:40,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 192 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-04-30 10:20:40,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-04-30 10:20:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077932351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:40,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:40,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-04-30 10:20:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903978507] [2025-04-30 10:20:40,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:40,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:20:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:40,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:20:40,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:20:40,340 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-04-30 10:20:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:40,396 INFO L93 Difference]: Finished difference Result 175 states and 233 transitions. [2025-04-30 10:20:40,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:20:40,397 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 108 [2025-04-30 10:20:40,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:40,398 INFO L225 Difference]: With dead ends: 175 [2025-04-30 10:20:40,398 INFO L226 Difference]: Without dead ends: 120 [2025-04-30 10:20:40,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:20:40,399 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:40,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-30 10:20:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-04-30 10:20:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.178082191780822) internal successors, (86), 78 states have internal predecessors, (86), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-04-30 10:20:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2025-04-30 10:20:40,412 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 108 [2025-04-30 10:20:40,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:40,412 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2025-04-30 10:20:40,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-04-30 10:20:40,412 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2025-04-30 10:20:40,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-04-30 10:20:40,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:40,415 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-04-30 10:20:40,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:40,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:20:40,616 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:40,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -60057080, now seen corresponding path program 2 times [2025-04-30 10:20:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:40,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855228613] [2025-04-30 10:20:40,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:20:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:40,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-30 10:20:40,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-04-30 10:20:40,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:20:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-04-30 10:20:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:40,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855228613] [2025-04-30 10:20:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855228613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:40,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329537189] [2025-04-30 10:20:40,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:20:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:40,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:40,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:20:40,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-30 10:20:40,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-04-30 10:20:40,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:20:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:40,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:20:40,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-04-30 10:20:40,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-04-30 10:20:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329537189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:41,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:41,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-30 10:20:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126339292] [2025-04-30 10:20:41,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:41,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:20:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:20:41,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:20:41,147 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-04-30 10:20:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:41,348 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2025-04-30 10:20:41,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:20:41,349 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 114 [2025-04-30 10:20:41,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:41,350 INFO L225 Difference]: With dead ends: 278 [2025-04-30 10:20:41,351 INFO L226 Difference]: Without dead ends: 277 [2025-04-30 10:20:41,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:20:41,351 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:41,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 201 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:20:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-04-30 10:20:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 217. [2025-04-30 10:20:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 138 states have (on average 1.181159420289855) internal successors, (163), 143 states have internal predecessors, (163), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-04-30 10:20:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 307 transitions. [2025-04-30 10:20:41,373 INFO L79 Accepts]: Start accepts. Automaton has 217 states and 307 transitions. Word has length 114 [2025-04-30 10:20:41,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:41,373 INFO L485 AbstractCegarLoop]: Abstraction has 217 states and 307 transitions. [2025-04-30 10:20:41,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 24 states have internal predecessors, (75), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-04-30 10:20:41,374 INFO L278 IsEmpty]: Start isEmpty. Operand 217 states and 307 transitions. [2025-04-30 10:20:41,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-04-30 10:20:41,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:41,375 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:41,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:41,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:41,575 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:41,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 836281506, now seen corresponding path program 2 times [2025-04-30 10:20:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:41,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875602353] [2025-04-30 10:20:41,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:20:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:41,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-04-30 10:20:41,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-04-30 10:20:41,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:20:41,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 51 proven. 19 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:41,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875602353] [2025-04-30 10:20:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875602353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:41,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899374104] [2025-04-30 10:20:41,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:20:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:41,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:41,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:41,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:20:41,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-04-30 10:20:41,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-04-30 10:20:41,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:20:41,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:41,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:20:41,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:41,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:20:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899374104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:20:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 14 [2025-04-30 10:20:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160982174] [2025-04-30 10:20:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:41,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:20:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:41,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:20:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:20:41,911 INFO L87 Difference]: Start difference. First operand 217 states and 307 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-04-30 10:20:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:42,004 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2025-04-30 10:20:42,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:20:42,005 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 135 [2025-04-30 10:20:42,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:42,006 INFO L225 Difference]: With dead ends: 229 [2025-04-30 10:20:42,006 INFO L226 Difference]: Without dead ends: 227 [2025-04-30 10:20:42,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:20:42,007 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:42,007 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 242 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-30 10:20:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2025-04-30 10:20:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 148 states have internal predecessors, (169), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-04-30 10:20:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2025-04-30 10:20:42,019 INFO L79 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 135 [2025-04-30 10:20:42,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:42,019 INFO L485 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2025-04-30 10:20:42,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-04-30 10:20:42,019 INFO L278 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2025-04-30 10:20:42,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-04-30 10:20:42,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:42,020 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:42,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:20:42,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:42,221 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:42,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash 154922980, now seen corresponding path program 1 times [2025-04-30 10:20:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:42,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352894735] [2025-04-30 10:20:42,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:42,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-04-30 10:20:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-04-30 10:20:42,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:42,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:42,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352894735] [2025-04-30 10:20:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352894735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:42,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049376139] [2025-04-30 10:20:42,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:42,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:42,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:42,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:42,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:20:42,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-04-30 10:20:42,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-04-30 10:20:42,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:42,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:42,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:20:42,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:42,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049376139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:42,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-04-30 10:20:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98405118] [2025-04-30 10:20:42,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:42,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:20:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:42,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:20:42,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:20:42,770 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 11 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2025-04-30 10:20:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:42,949 INFO L93 Difference]: Finished difference Result 272 states and 387 transitions. [2025-04-30 10:20:42,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:20:42,950 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 11 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) Word has length 136 [2025-04-30 10:20:42,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:42,952 INFO L225 Difference]: With dead ends: 272 [2025-04-30 10:20:42,952 INFO L226 Difference]: Without dead ends: 270 [2025-04-30 10:20:42,952 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:20:42,954 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:42,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-30 10:20:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2025-04-30 10:20:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 149 states have (on average 1.1610738255033557) internal successors, (173), 153 states have internal predecessors, (173), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-04-30 10:20:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2025-04-30 10:20:42,970 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 333 transitions. Word has length 136 [2025-04-30 10:20:42,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:42,970 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 333 transitions. [2025-04-30 10:20:42,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 11 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2025-04-30 10:20:42,971 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 333 transitions. [2025-04-30 10:20:42,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-04-30 10:20:42,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:42,972 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:42,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:43,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:20:43,173 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:43,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash -485807488, now seen corresponding path program 1 times [2025-04-30 10:20:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:43,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314493443] [2025-04-30 10:20:43,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:43,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-30 10:20:43,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:20:43,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:43,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2025-04-30 10:20:43,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:43,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314493443] [2025-04-30 10:20:43,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314493443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:43,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413310598] [2025-04-30 10:20:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:43,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:43,414 INFO L229 MonitoredProcess]: Starting monitored process 10 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:20:43,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:20:43,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-30 10:20:43,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:20:43,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:43,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:43,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:20:43,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 70 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:43,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-30 10:20:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413310598] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:43,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2025-04-30 10:20:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828904285] [2025-04-30 10:20:43,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:43,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:20:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:43,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:20:43,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:20:43,883 INFO L87 Difference]: Start difference. First operand 235 states and 333 transitions. Second operand has 33 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 11 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 11 states have call predecessors, (48), 11 states have call successors, (48) [2025-04-30 10:20:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:44,203 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2025-04-30 10:20:44,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:20:44,203 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 11 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 11 states have call predecessors, (48), 11 states have call successors, (48) Word has length 141 [2025-04-30 10:20:44,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:44,204 INFO L225 Difference]: With dead ends: 235 [2025-04-30 10:20:44,205 INFO L226 Difference]: Without dead ends: 232 [2025-04-30 10:20:44,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:20:44,206 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:44,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:20:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-04-30 10:20:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 177. [2025-04-30 10:20:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.0789473684210527) internal successors, (123), 115 states have internal predecessors, (123), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-04-30 10:20:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 243 transitions. [2025-04-30 10:20:44,219 INFO L79 Accepts]: Start accepts. Automaton has 177 states and 243 transitions. Word has length 141 [2025-04-30 10:20:44,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:44,219 INFO L485 AbstractCegarLoop]: Abstraction has 177 states and 243 transitions. [2025-04-30 10:20:44,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 11 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 11 states have call predecessors, (48), 11 states have call successors, (48) [2025-04-30 10:20:44,220 INFO L278 IsEmpty]: Start isEmpty. Operand 177 states and 243 transitions. [2025-04-30 10:20:44,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-04-30 10:20:44,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:44,221 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:44,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:20:44,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:20:44,422 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:44,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash -260354508, now seen corresponding path program 1 times [2025-04-30 10:20:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:44,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475615364] [2025-04-30 10:20:44,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:44,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:20:44,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:20:44,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-04-30 10:20:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:44,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475615364] [2025-04-30 10:20:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475615364] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:44,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687180250] [2025-04-30 10:20:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:44,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:44,623 INFO L229 MonitoredProcess]: Starting monitored process 11 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:20:44,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:20:44,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:20:44,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:20:44,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:44,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:44,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:20:44,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-04-30 10:20:44,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:20:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687180250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:44,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:20:44,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 23 [2025-04-30 10:20:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033872367] [2025-04-30 10:20:44,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:44,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:20:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:44,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:20:44,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:20:44,807 INFO L87 Difference]: Start difference. First operand 177 states and 243 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-04-30 10:20:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:44,900 INFO L93 Difference]: Finished difference Result 238 states and 324 transitions. [2025-04-30 10:20:44,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:20:44,900 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 165 [2025-04-30 10:20:44,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:44,901 INFO L225 Difference]: With dead ends: 238 [2025-04-30 10:20:44,901 INFO L226 Difference]: Without dead ends: 119 [2025-04-30 10:20:44,903 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:20:44,904 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:44,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 180 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:20:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-30 10:20:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-04-30 10:20:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-04-30 10:20:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2025-04-30 10:20:44,915 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 165 [2025-04-30 10:20:44,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:44,916 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2025-04-30 10:20:44,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-04-30 10:20:44,916 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2025-04-30 10:20:44,918 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-04-30 10:20:44,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:44,918 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-04-30 10:20:44,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:20:45,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:20:45,123 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-04-30 10:20:45,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:45,123 INFO L85 PathProgramCache]: Analyzing trace with hash -676562934, now seen corresponding path program 1 times [2025-04-30 10:20:45,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:45,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961017489] [2025-04-30 10:20:45,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-04-30 10:20:45,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-04-30 10:20:45,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:45,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 3174 trivial. 0 not checked. [2025-04-30 10:20:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:45,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961017489] [2025-04-30 10:20:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961017489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:45,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453197940] [2025-04-30 10:20:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:45,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:45,597 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:45,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:20:45,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-04-30 10:20:45,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-04-30 10:20:45,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:45,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:45,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:20:45,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 36 proven. 266 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2025-04-30 10:20:45,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 36 proven. 266 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2025-04-30 10:20:46,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453197940] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:46,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:46,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 35 [2025-04-30 10:20:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346804031] [2025-04-30 10:20:46,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:46,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-30 10:20:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:46,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-30 10:20:46,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:20:46,258 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 16 states have call predecessors, (68), 16 states have call successors, (68) [2025-04-30 10:20:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:46,632 INFO L93 Difference]: Finished difference Result 231 states and 312 transitions. [2025-04-30 10:20:46,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-30 10:20:46,632 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 16 states have call predecessors, (68), 16 states have call successors, (68) Word has length 274 [2025-04-30 10:20:46,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:46,634 INFO L225 Difference]: With dead ends: 231 [2025-04-30 10:20:46,634 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:20:46,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:20:46,635 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:46,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 165 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:20:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:20:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:20:46,636 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:20:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:20:46,636 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2025-04-30 10:20:46,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:46,636 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:20:46,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 16 states have call predecessors, (68), 16 states have call successors, (68) [2025-04-30 10:20:46,637 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:20:46,637 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-04-30 10:20:46,639 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-04-30 10:20:46,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:46,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:20:46,843 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:46,844 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-30 10:20:47,685 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:20:47,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:20:47 BoogieIcfgContainer [2025-04-30 10:20:47,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:20:47,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:20:47,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:20:47,701 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:20:47,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:20:36" (3/4) ... [2025-04-30 10:20:47,704 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:20:47,708 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-04-30 10:20:47,715 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-04-30 10:20:47,715 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-30 10:20:47,715 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:20:47,715 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:20:47,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:20:47,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:20:47,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:20:47,777 INFO L158 Benchmark]: Toolchain (without parser) took 11291.35ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 112.9MB in the beginning and 149.5MB in the end (delta: -36.6MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2025-04-30 10:20:47,777 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:20:47,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.20ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:20:47,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.55ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:20:47,778 INFO L158 Benchmark]: Boogie Preprocessor took 31.19ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:20:47,778 INFO L158 Benchmark]: RCFGBuilder took 232.90ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 84.4MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:20:47,778 INFO L158 Benchmark]: TraceAbstraction took 10734.35ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 84.0MB in the beginning and 155.5MB in the end (delta: -71.5MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. [2025-04-30 10:20:47,779 INFO L158 Benchmark]: Witness Printer took 75.00ms. Allocated memory is still 268.4MB. Free memory was 155.5MB in the beginning and 149.5MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:20:47,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.20ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.55ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.19ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.90ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 84.4MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10734.35ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 84.0MB in the beginning and 155.5MB in the end (delta: -71.5MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. * Witness Printer took 75.00ms. Allocated memory is still 268.4MB. Free memory was 155.5MB in the beginning and 149.5MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 64 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 16, TraceHistogramMax: 40, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 2532 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1938 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2165 IncrementalHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 594 mSDtfsCounter, 2165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2219 GetRequests, 1983 SyntacticMatches, 7 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1837 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 237 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3343 ConstructedInterpolants, 0 QuantifiedInterpolants, 6511 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2442 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 21533/23131 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 12 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i == 0) || ((1 <= i) && (i <= 2147483646))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((i == 1) && (j == 1)) || ((2 == j) && (2 == i))) || (((3 == j) && (i <= 2147483643)) && (j <= i))) || ((i == 0) && (j == 0))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((i <= 4) && (2 <= i)) && (j == 1))) || ((((i <= 2147483644) && (j <= 2147483643)) && (4 <= j)) && (j <= i))) || (((2 == j) && (3 <= i)) && (i <= 5))) RESULT: Ultimate proved your program to be correct! [2025-04-30 10:20:47,793 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