./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:44:56,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:44:57,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:44:57,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:44:57,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:44:57,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:44:57,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:44:57,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:44:57,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:44:57,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:44:57,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:44:57,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:44:57,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:44:57,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:44:57,038 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:44:57,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:44:57,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:44:57,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:44:57,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:44:57,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:44:57,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:57,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:57,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:44:57,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:44:57,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:44:57,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:44:57,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:44:57,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:44:57,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:44:57,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:44:57,041 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-jdk21/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 -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 [2025-01-10 01:44:57,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:44:57,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:44:57,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:44:57,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:44:57,213 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:44:57,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c [2025-01-10 01:44:58,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21d28260f/a114b55ea9b1485f96ef159a9ffbfb4d/FLAGfbfe6bb6f [2025-01-10 01:44:58,574 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:44:58,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2025-01-10 01:44:58,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21d28260f/a114b55ea9b1485f96ef159a9ffbfb4d/FLAGfbfe6bb6f [2025-01-10 01:44:58,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21d28260f/a114b55ea9b1485f96ef159a9ffbfb4d [2025-01-10 01:44:58,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:44:58,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:44:58,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:44:58,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:44:58,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:44:58,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:44:58" (1/1) ... [2025-01-10 01:44:58,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719927df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:58, skipping insertion in model container [2025-01-10 01:44:58,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:44:58" (1/1) ... [2025-01-10 01:44:58,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:44:59,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:44:59,032 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:44:59,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:44:59,050 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:44:59,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59 WrapperNode [2025-01-10 01:44:59,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:44:59,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:44:59,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:44:59,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:44:59,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,071 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-01-10 01:44:59,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:44:59,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:44:59,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:44:59,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:44:59,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,085 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-01-10 01:44:59,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:44:59,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:44:59,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:44:59,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:44:59,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (1/1) ... [2025-01-10 01:44:59,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:59,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:59,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:44:59,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:44:59,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:44:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:44:59,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:44:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:44:59,188 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:44:59,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:44:59,260 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-10 01:44:59,260 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:44:59,265 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:44:59,265 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:44:59,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:59 BoogieIcfgContainer [2025-01-10 01:44:59,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:44:59,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:44:59,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:44:59,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:44:59,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:44:58" (1/3) ... [2025-01-10 01:44:59,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76337902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:44:59, skipping insertion in model container [2025-01-10 01:44:59,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:59" (2/3) ... [2025-01-10 01:44:59,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76337902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:44:59, skipping insertion in model container [2025-01-10 01:44:59,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:59" (3/3) ... [2025-01-10 01:44:59,272 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_3.c [2025-01-10 01:44:59,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:44:59,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_3.c that has 1 procedures, 23 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 01:44:59,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:44:59,350 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f03cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:44:59,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:44:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.625) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:44:59,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:59,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:44:59,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:44:59,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash 28695332, now seen corresponding path program 1 times [2025-01-10 01:44:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:59,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098172892] [2025-01-10 01:44:59,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:59,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:44:59,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:44:59,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:59,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098172892] [2025-01-10 01:44:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098172892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:59,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:59,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445003647] [2025-01-10 01:44:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:59,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:59,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:59,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:59,550 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.625) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:59,574 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-01-10 01:44:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:44:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:59,579 INFO L225 Difference]: With dead ends: 51 [2025-01-10 01:44:59,579 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 01:44:59,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:59,582 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:59,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 01:44:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-01-10 01:44:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-01-10 01:44:59,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 5 [2025-01-10 01:44:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:59,601 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-01-10 01:44:59,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-01-10 01:44:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:44:59,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:59,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:44:59,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:44:59,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:44:59,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash 889539528, now seen corresponding path program 1 times [2025-01-10 01:44:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376714027] [2025-01-10 01:44:59,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:59,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:44:59,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:44:59,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:59,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:59,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:59,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376714027] [2025-01-10 01:44:59,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376714027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:59,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:59,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:44:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414714465] [2025-01-10 01:44:59,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:59,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:59,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:59,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:59,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:59,633 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:59,649 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-01-10 01:44:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:44:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:59,650 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:44:59,650 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:44:59,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:59,651 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:59,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:44:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:44:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-01-10 01:44:59,655 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2025-01-10 01:44:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:59,655 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-01-10 01:44:59,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-01-10 01:44:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:44:59,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:59,655 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:59,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:44:59,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:44:59,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 323909866, now seen corresponding path program 1 times [2025-01-10 01:44:59,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:59,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360560169] [2025-01-10 01:44:59,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:59,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:44:59,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:44:59,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:59,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360560169] [2025-01-10 01:44:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360560169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372030716] [2025-01-10 01:44:59,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:59,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:59,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:59,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:44:59,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:44:59,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:44:59,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:59,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:59,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:44:59,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:59,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:44:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372030716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:44:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:44:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014740793] [2025-01-10 01:44:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:59,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:59,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:59,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:59,762 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:59,776 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-01-10 01:44:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:44:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:59,777 INFO L225 Difference]: With dead ends: 29 [2025-01-10 01:44:59,777 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:44:59,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:59,778 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:59,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 14 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:44:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:44:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-10 01:44:59,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2025-01-10 01:44:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:59,781 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-10 01:44:59,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-10 01:44:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:44:59,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:59,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:59,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:44:59,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:59,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:44:59,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1451271302, now seen corresponding path program 1 times [2025-01-10 01:44:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909029912] [2025-01-10 01:44:59,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:59,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:44:59,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:44:59,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:59,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:45:00,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909029912] [2025-01-10 01:45:00,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909029912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:00,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:45:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106589655] [2025-01-10 01:45:00,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:00,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:00,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:00,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:00,043 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:00,052 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-01-10 01:45:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:00,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:45:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:00,053 INFO L225 Difference]: With dead ends: 28 [2025-01-10 01:45:00,053 INFO L226 Difference]: Without dead ends: 27 [2025-01-10 01:45:00,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:00,053 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:00,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-10 01:45:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-01-10 01:45:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-01-10 01:45:00,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 10 [2025-01-10 01:45:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-01-10 01:45:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-01-10 01:45:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:45:00,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:00,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:00,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:45:00,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:45:00,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1186922546, now seen corresponding path program 1 times [2025-01-10 01:45:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943775061] [2025-01-10 01:45:00,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:00,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:45:00,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:45:00,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:00,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943775061] [2025-01-10 01:45:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943775061] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:00,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933579210] [2025-01-10 01:45:00,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:00,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:00,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:00,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:00,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:45:00,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:45:00,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:45:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:45:00,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:45:00,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933579210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:45:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713114479] [2025-01-10 01:45:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:00,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:00,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:45:00,138 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:00,146 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-01-10 01:45:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:00,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-01-10 01:45:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:00,146 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:45:00,147 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:45:00,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:45:00,147 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:00,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:45:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-10 01:45:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-01-10 01:45:00,150 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2025-01-10 01:45:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:00,151 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-01-10 01:45:00,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-01-10 01:45:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:45:00,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:00,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:00,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:00,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:00,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:45:00,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1860106798, now seen corresponding path program 1 times [2025-01-10 01:45:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513618361] [2025-01-10 01:45:00,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:00,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:45:00,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:45:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513618361] [2025-01-10 01:45:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513618361] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345128201] [2025-01-10 01:45:00,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:00,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:00,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:00,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:00,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:45:00,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:45:00,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:45:00,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:00,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:45:00,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:45:00,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345128201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:00,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:00,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:45:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449616079] [2025-01-10 01:45:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:00,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:00,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:00,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:45:00,444 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:00,455 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-01-10 01:45:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:00,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:45:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:00,455 INFO L225 Difference]: With dead ends: 42 [2025-01-10 01:45:00,455 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:45:00,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:45:00,456 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:00,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:45:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-01-10 01:45:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-01-10 01:45:00,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 13 [2025-01-10 01:45:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-01-10 01:45:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-01-10 01:45:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:45:00,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:00,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:00,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:00,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:00,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:45:00,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash 302201172, now seen corresponding path program 1 times [2025-01-10 01:45:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063356196] [2025-01-10 01:45:00,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:45:00,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:45:00,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:00,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:45:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063356196] [2025-01-10 01:45:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063356196] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595114109] [2025-01-10 01:45:00,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:00,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:00,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:45:00,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:45:00,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:45:00,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:00,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:00,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:45:00,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:45:00,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:45:00,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595114109] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:00,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:00,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:45:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388471631] [2025-01-10 01:45:00,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:00,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:45:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:00,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:45:00,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:45:00,775 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:00,799 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2025-01-10 01:45:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 01:45:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:00,800 INFO L225 Difference]: With dead ends: 106 [2025-01-10 01:45:00,800 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 01:45:00,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:45:00,801 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:00,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 01:45:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-10 01:45:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2025-01-10 01:45:00,808 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 16 [2025-01-10 01:45:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:00,808 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2025-01-10 01:45:00,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2025-01-10 01:45:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:45:00,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:00,809 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:00,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:01,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-10 01:45:01,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:45:01,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1350101508, now seen corresponding path program 2 times [2025-01-10 01:45:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77932225] [2025-01-10 01:45:01,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:01,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:45:01,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:45:01,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 01:45:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77932225] [2025-01-10 01:45:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77932225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332493480] [2025-01-10 01:45:01,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:01,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:01,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:01,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:45:01,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:45:01,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:45:01,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:01,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:01,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:45:01,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:45:01,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:45:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332493480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:01,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2025-01-10 01:45:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731438987] [2025-01-10 01:45:01,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:01,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:45:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:01,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:45:01,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:45:01,295 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:01,513 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2025-01-10 01:45:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:45:01,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-10 01:45:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:01,514 INFO L225 Difference]: With dead ends: 156 [2025-01-10 01:45:01,514 INFO L226 Difference]: Without dead ends: 98 [2025-01-10 01:45:01,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:45:01,515 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:01,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-10 01:45:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-10 01:45:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.09375) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-01-10 01:45:01,522 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2025-01-10 01:45:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-01-10 01:45:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-01-10 01:45:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 01:45:01,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:01,524 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:45:01,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:45:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:01,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:45:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -462264518, now seen corresponding path program 1 times [2025-01-10 01:45:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32085140] [2025-01-10 01:45:01,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:01,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:45:01,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:45:01,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:01,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-10 01:45:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32085140] [2025-01-10 01:45:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32085140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:45:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865613665] [2025-01-10 01:45:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:01,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:01,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:01,776 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:01,786 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2025-01-10 01:45:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-10 01:45:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:01,788 INFO L225 Difference]: With dead ends: 98 [2025-01-10 01:45:01,788 INFO L226 Difference]: Without dead ends: 97 [2025-01-10 01:45:01,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:01,791 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:01,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-10 01:45:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2025-01-10 01:45:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-01-10 01:45:01,802 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 47 [2025-01-10 01:45:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:01,803 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-01-10 01:45:01,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-01-10 01:45:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 01:45:01,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:01,803 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:45:01,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:45:01,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:45:01,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 807386198, now seen corresponding path program 1 times [2025-01-10 01:45:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:01,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820245219] [2025-01-10 01:45:01,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:01,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:45:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:45:01,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-10 01:45:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820245219] [2025-01-10 01:45:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820245219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065859127] [2025-01-10 01:45:01,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:01,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:01,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:01,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:45:01,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:45:01,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:45:01,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:01,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:01,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:45:01,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-10 01:45:01,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065859127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:45:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308718680] [2025-01-10 01:45:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:01,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:01,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:01,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:45:01,932 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:01,959 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-01-10 01:45:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-10 01:45:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:01,959 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:45:01,960 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:45:01,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:45:01,960 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:01,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:45:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:45:01,961 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-01-10 01:45:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:45:01,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2025-01-10 01:45:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:01,961 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:45:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:45:01,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:45:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:45:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:45:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:45:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:45:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:45:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:45:01,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:45:02,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:45:02,170 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:02,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:45:02,416 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:45:02,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:45:02 BoogieIcfgContainer [2025-01-10 01:45:02,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:45:02,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:45:02,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:45:02,426 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:45:02,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:59" (3/4) ... [2025-01-10 01:45:02,427 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:45:02,436 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-10 01:45:02,436 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:45:02,436 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:45:02,436 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:45:02,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:45:02,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:45:02,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:45:02,504 INFO L158 Benchmark]: Toolchain (without parser) took 3597.05ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 93.0MB in the end (delta: 31.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-01-10 01:45:02,504 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:02,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.78ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 114.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:45:02,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.34ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 113.1MB in the end (delta: 882.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:02,504 INFO L158 Benchmark]: Boogie Preprocessor took 24.90ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 112.2MB in the end (delta: 866.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:02,505 INFO L158 Benchmark]: RCFGBuilder took 168.48ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 101.5MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:45:02,505 INFO L158 Benchmark]: TraceAbstraction took 3157.51ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 98.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:02,505 INFO L158 Benchmark]: Witness Printer took 77.83ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 93.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:45:02,506 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.78ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 114.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.34ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 113.1MB in the end (delta: 882.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.90ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 112.2MB in the end (delta: 866.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 168.48ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 101.5MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3157.51ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 98.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.83ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 93.0MB in the end (delta: 5.3MB). 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: 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: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 131 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 937/1048 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 6 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((1 <= c) && (1 <= b)) && (0 <= a)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((c == 0) && (b <= 5)) && (1 <= b)) && (0 <= a)) || (((c == 0) && (b == 0)) && (0 <= a))) && (a <= 5)) || ((a <= 5) && ((((b == 0) && (1 <= c)) && (0 <= a)) || ((((1 <= c) && (b <= 5)) && (1 <= b)) && (0 <= a))))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((1 <= c) && (a <= 5)) && (1 <= b)) && (0 <= a)) || ((((b == 0) && (1 <= c)) && (a <= 5)) && (0 <= a))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:45:02,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE