./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 45da0ec55e80675b886f8e641f164866abb91ea1313f371255aeb32277275561 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:54:46,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:54:46,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 12:54:46,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:54:46,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:54:46,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:54:46,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:54:46,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:54:46,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:54:46,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:54:46,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:54:46,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:54:46,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:54:46,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:54:46,286 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:54:46,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:54:46,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:54:46,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:54:46,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:54:46,288 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45da0ec55e80675b886f8e641f164866abb91ea1313f371255aeb32277275561 [2025-02-08 12:54:46,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:54:46,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:54:46,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:54:46,493 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:54:46,494 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:54:46,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2025-02-08 12:54:47,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7693fddc/fa26572c47054dc18b35c0e47a74cdf8/FLAG4079e2e17 [2025-02-08 12:54:48,085 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:54:48,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2025-02-08 12:54:48,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7693fddc/fa26572c47054dc18b35c0e47a74cdf8/FLAG4079e2e17 [2025-02-08 12:54:48,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7693fddc/fa26572c47054dc18b35c0e47a74cdf8 [2025-02-08 12:54:48,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:54:48,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:54:48,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:54:48,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:54:48,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:54:48,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48, skipping insertion in model container [2025-02-08 12:54:48,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:54:48,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:54:48,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:54:48,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:54:48,820 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:54:48,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48 WrapperNode [2025-02-08 12:54:48,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:54:48,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:54:48,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:54:48,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:54:48,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,870 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 86 [2025-02-08 12:54:48,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:54:48,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:54:48,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:54:48,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:54:48,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,896 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 12:54:48,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:54:48,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:54:48,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:54:48,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:54:48,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (1/1) ... [2025-02-08 12:54:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:54:48,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:54:48,951 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-02-08 12:54:48,957 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-02-08 12:54:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 12:54:48,976 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 12:54:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:54:48,976 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:54:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:54:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:54:48,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:54:49,084 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:54:49,085 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:54:49,198 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-08 12:54:49,198 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:54:49,205 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:54:49,205 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:54:49,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:54:49 BoogieIcfgContainer [2025-02-08 12:54:49,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:54:49,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:54:49,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:54:49,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:54:49,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:54:48" (1/3) ... [2025-02-08 12:54:49,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fa9314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:54:49, skipping insertion in model container [2025-02-08 12:54:49,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:54:48" (2/3) ... [2025-02-08 12:54:49,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fa9314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:54:49, skipping insertion in model container [2025-02-08 12:54:49,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:54:49" (3/3) ... [2025-02-08 12:54:49,212 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2025-02-08 12:54:49,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:54:49,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_predec_17_good.i that has 3 procedures, 49 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-02-08 12:54:49,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:54:49,280 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;@6a3068b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:54:49,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 12:54:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 12:54:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 12:54:49,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:49,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:49,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:49,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1400842932, now seen corresponding path program 1 times [2025-02-08 12:54:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911266185] [2025-02-08 12:54:49,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:49,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 12:54:49,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 12:54:49,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:49,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:54:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911266185] [2025-02-08 12:54:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911266185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:54:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778891687] [2025-02-08 12:54:49,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:49,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:54:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:49,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:54:49,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:49,576 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:49,624 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2025-02-08 12:54:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:54:49,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-02-08 12:54:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:49,632 INFO L225 Difference]: With dead ends: 95 [2025-02-08 12:54:49,633 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 12:54:49,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:49,639 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:49,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 12:54:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 12:54:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-02-08 12:54:49,683 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 9 [2025-02-08 12:54:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:49,684 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-02-08 12:54:49,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-02-08 12:54:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 12:54:49,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:49,697 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 12:54:49,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:49,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1685441055, now seen corresponding path program 1 times [2025-02-08 12:54:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516477647] [2025-02-08 12:54:49,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:49,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 12:54:49,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 12:54:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:49,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:54:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516477647] [2025-02-08 12:54:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516477647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:54:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454541808] [2025-02-08 12:54:49,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:54:49,871 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-02-08 12:54:49,872 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-02-08 12:54:49,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 12:54:49,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 12:54:49,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:49,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:49,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 12:54:49,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:54:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:54:49,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:54:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454541808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:54:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 12:54:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461720524] [2025-02-08 12:54:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:49,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 12:54:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 12:54:49,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 12:54:49,984 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:49,999 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2025-02-08 12:54:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 12:54:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 12:54:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,000 INFO L225 Difference]: With dead ends: 86 [2025-02-08 12:54:50,000 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 12:54:50,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 12:54:50,001 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 12:54:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 12:54:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.5) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-02-08 12:54:50,005 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 12 [2025-02-08 12:54:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,005 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-02-08 12:54:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-02-08 12:54:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 12:54:50,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 12:54:50,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:50,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 506030749, now seen corresponding path program 1 times [2025-02-08 12:54:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853160069] [2025-02-08 12:54:50,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 12:54:50,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 12:54:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 12:54:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853160069] [2025-02-08 12:54:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853160069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:54:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001508358] [2025-02-08 12:54:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:54:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:54:50,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:54:50,241 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,253 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-02-08 12:54:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:54:50,253 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-08 12:54:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,253 INFO L225 Difference]: With dead ends: 44 [2025-02-08 12:54:50,254 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 12:54:50,254 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-02-08 12:54:50,254 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 12:54:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 12:54:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-08 12:54:50,258 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2025-02-08 12:54:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,258 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-08 12:54:50,258 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-08 12:54:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 12:54:50,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 12:54:50,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 506015887, now seen corresponding path program 1 times [2025-02-08 12:54:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659978825] [2025-02-08 12:54:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 12:54:50,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 12:54:50,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 12:54:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659978825] [2025-02-08 12:54:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659978825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:54:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648521535] [2025-02-08 12:54:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:54:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:54:50,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:54:50,291 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,301 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-08 12:54:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:54:50,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-08 12:54:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,302 INFO L225 Difference]: With dead ends: 71 [2025-02-08 12:54:50,302 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 12:54:50,302 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-02-08 12:54:50,303 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 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-02-08 12:54:50,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 12:54:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2025-02-08 12:54:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-02-08 12:54:50,308 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 14 [2025-02-08 12:54:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,308 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-02-08 12:54:50,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-02-08 12:54:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 12:54:50,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 12:54:50,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1492915961, now seen corresponding path program 1 times [2025-02-08 12:54:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957825973] [2025-02-08 12:54:50,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 12:54:50,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 12:54:50,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:54:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957825973] [2025-02-08 12:54:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957825973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:54:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454640135] [2025-02-08 12:54:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:54:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:54:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:54:50,341 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,350 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-02-08 12:54:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:54:50,351 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 12:54:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,351 INFO L225 Difference]: With dead ends: 44 [2025-02-08 12:54:50,351 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 12:54:50,351 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-02-08 12:54:50,352 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 12:54:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 12:54:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-08 12:54:50,356 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 15 [2025-02-08 12:54:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-08 12:54:50,356 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:54:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-08 12:54:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 12:54:50,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 12:54:50,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1554761274, now seen corresponding path program 1 times [2025-02-08 12:54:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624950736] [2025-02-08 12:54:50,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 12:54:50,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 12:54:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 12:54:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624950736] [2025-02-08 12:54:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624950736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:50,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:54:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964396783] [2025-02-08 12:54:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:54:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:54:50,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:50,398 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 12:54:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,418 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-02-08 12:54:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:54:50,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-08 12:54:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,419 INFO L225 Difference]: With dead ends: 54 [2025-02-08 12:54:50,419 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 12:54:50,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:50,420 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 12:54:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 12:54:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:54:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-08 12:54:50,424 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 20 [2025-02-08 12:54:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,424 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-08 12:54:50,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 12:54:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-08 12:54:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 12:54:50,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 12:54:50,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 125073923, now seen corresponding path program 1 times [2025-02-08 12:54:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144812329] [2025-02-08 12:54:50,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 12:54:50,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 12:54:50,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144812329] [2025-02-08 12:54:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144812329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:54:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297288010] [2025-02-08 12:54:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:54:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:54:50,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:50,498 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,515 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-02-08 12:54:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:54:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-08 12:54:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,516 INFO L225 Difference]: With dead ends: 71 [2025-02-08 12:54:50,516 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 12:54:50,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:50,517 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 12:54:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 12:54:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 48 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:54:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-02-08 12:54:50,522 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 24 [2025-02-08 12:54:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,522 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-02-08 12:54:50,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-02-08 12:54:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 12:54:50,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 12:54:50,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1954381646, now seen corresponding path program 1 times [2025-02-08 12:54:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238724923] [2025-02-08 12:54:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 12:54:50,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 12:54:50,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238724923] [2025-02-08 12:54:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238724923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:54:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216772183] [2025-02-08 12:54:50,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:54:50,579 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-02-08 12:54:50,581 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-02-08 12:54:50,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 12:54:50,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 12:54:50,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 12:54:50,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:54:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:50,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:54:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216772183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:54:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 12:54:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478232197] [2025-02-08 12:54:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 12:54:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 12:54:50,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 12:54:50,653 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,663 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-02-08 12:54:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 12:54:50,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-02-08 12:54:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,664 INFO L225 Difference]: With dead ends: 70 [2025-02-08 12:54:50,664 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 12:54:50,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 12:54:50,665 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 12:54:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 12:54:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 44 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:54:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 12:54:50,669 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 27 [2025-02-08 12:54:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,670 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 12:54:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 12:54:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 12:54:50,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,676 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-02-08 12:54:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:50,873 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash -456293824, now seen corresponding path program 1 times [2025-02-08 12:54:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693112396] [2025-02-08 12:54:50,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 12:54:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 12:54:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:50,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693112396] [2025-02-08 12:54:50,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693112396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:54:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049149339] [2025-02-08 12:54:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:50,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:54:50,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:50,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:54:50,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:54:50,912 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:50,932 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2025-02-08 12:54:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:54:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-08 12:54:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:50,933 INFO L225 Difference]: With dead ends: 55 [2025-02-08 12:54:50,934 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 12:54:50,934 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-02-08 12:54:50,934 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:50,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 12:54:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-02-08 12:54:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 46 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:54:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-08 12:54:50,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 28 [2025-02-08 12:54:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:50,941 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-08 12:54:50,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-08 12:54:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 12:54:50,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:50,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 12:54:50,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:50,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash -946365382, now seen corresponding path program 1 times [2025-02-08 12:54:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176972147] [2025-02-08 12:54:50,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 12:54:50,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 12:54:50,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 12:54:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176972147] [2025-02-08 12:54:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176972147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:54:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041121077] [2025-02-08 12:54:50,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:50,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:50,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:54:50,986 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-02-08 12:54:50,987 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-02-08 12:54:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 12:54:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 12:54:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:51,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:51,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 12:54:51,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:54:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 12:54:51,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:54:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041121077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 12:54:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 12:54:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900743993] [2025-02-08 12:54:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:51,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 12:54:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:51,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 12:54:51,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 12:54:51,060 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 12:54:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:51,077 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2025-02-08 12:54:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 12:54:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-02-08 12:54:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:51,078 INFO L225 Difference]: With dead ends: 78 [2025-02-08 12:54:51,078 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 12:54:51,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 12:54:51,079 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:51,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 142 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 12:54:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 12:54:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.1875) internal successors, (38), 36 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-02-08 12:54:51,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2025-02-08 12:54:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-02-08 12:54:51,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 12:54:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-02-08 12:54:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 12:54:51,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:51,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:51,091 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-02-08 12:54:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:51,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1260206671, now seen corresponding path program 1 times [2025-02-08 12:54:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264152926] [2025-02-08 12:54:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 12:54:51,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 12:54:51,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:51,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264152926] [2025-02-08 12:54:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264152926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:54:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176779497] [2025-02-08 12:54:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:51,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:54:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:51,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:54:51,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:54:51,314 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:51,321 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-02-08 12:54:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:54:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 12:54:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:51,322 INFO L225 Difference]: With dead ends: 42 [2025-02-08 12:54:51,322 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 12:54:51,322 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-02-08 12:54:51,322 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 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-02-08 12:54:51,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 12:54:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-08 12:54:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:54:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-02-08 12:54:51,330 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 29 [2025-02-08 12:54:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:51,330 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-02-08 12:54:51,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 12:54:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-02-08 12:54:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 12:54:51,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:51,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:51,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 12:54:51,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -375068881, now seen corresponding path program 1 times [2025-02-08 12:54:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531207779] [2025-02-08 12:54:51,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:51,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 12:54:51,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 12:54:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 12:54:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531207779] [2025-02-08 12:54:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531207779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:54:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:54:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:54:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141139865] [2025-02-08 12:54:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:54:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:54:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:54:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:51,368 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 12:54:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:51,399 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-02-08 12:54:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:54:51,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-02-08 12:54:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:51,400 INFO L225 Difference]: With dead ends: 48 [2025-02-08 12:54:51,400 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 12:54:51,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:54:51,401 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:51,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 12:54:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 12:54:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 12:54:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-02-08 12:54:51,404 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 35 [2025-02-08 12:54:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:51,404 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-02-08 12:54:51,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 12:54:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-02-08 12:54:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 12:54:51,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:54:51,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:51,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 12:54:51,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 12:54:51,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:54:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1827849786, now seen corresponding path program 1 times [2025-02-08 12:54:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:54:51,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045402309] [2025-02-08 12:54:51,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:51,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:54:51,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 12:54:51,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 12:54:51,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:51,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 12:54:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:54:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045402309] [2025-02-08 12:54:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045402309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 12:54:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580533416] [2025-02-08 12:54:51,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:54:51,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:54:51,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:54:51,451 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-02-08 12:54:51,453 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-02-08 12:54:51,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 12:54:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 12:54:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:54:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:54:51,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:54:51,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:54:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:51,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 12:54:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 12:54:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580533416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 12:54:51,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 12:54:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-08 12:54:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733170446] [2025-02-08 12:54:51,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 12:54:51,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 12:54:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:54:51,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 12:54:51,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 12:54:51,578 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 12:54:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:54:51,619 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-02-08 12:54:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 12:54:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2025-02-08 12:54:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:54:51,619 INFO L225 Difference]: With dead ends: 50 [2025-02-08 12:54:51,619 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 12:54:51,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-08 12:54:51,620 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:54:51,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:54:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 12:54:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 12:54:51,621 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-02-08 12:54:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 12:54:51,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2025-02-08 12:54:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:54:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 12:54:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 12:54:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 12:54:51,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 12:54:51,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-02-08 12:54:51,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-02-08 12:54:51,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-02-08 12:54:51,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-02-08 12:54:51,630 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-02-08 12:54:51,825 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,SelfDestructingSolverStorable12 [2025-02-08 12:54:51,827 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:54:51,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 12:54:51,892 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:54:51,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:54:51 BoogieIcfgContainer [2025-02-08 12:54:51,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:54:51,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:54:51,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:54:51,904 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:54:51,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:54:49" (3/4) ... [2025-02-08 12:54:51,906 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 12:54:51,910 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 12:54:51,911 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 12:54:51,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 12:54:51,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 12:54:51,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 12:54:51,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 12:54:51,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 12:54:51,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:54:51,971 INFO L158 Benchmark]: Toolchain (without parser) took 3841.23ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 83.4MB in the end (delta: 36.0MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-02-08 12:54:51,971 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:54:51,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.78ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 59.6MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 12:54:51,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.57ms. Allocated memory is still 167.8MB. Free memory was 59.6MB in the beginning and 56.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:54:51,972 INFO L158 Benchmark]: Boogie Preprocessor took 45.57ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 55.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:54:51,972 INFO L158 Benchmark]: IcfgBuilder took 288.20ms. Allocated memory is still 167.8MB. Free memory was 55.4MB in the beginning and 40.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 12:54:51,972 INFO L158 Benchmark]: TraceAbstraction took 2696.51ms. Allocated memory is still 167.8MB. Free memory was 40.3MB in the beginning and 88.9MB in the end (delta: -48.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:54:51,972 INFO L158 Benchmark]: Witness Printer took 66.73ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 83.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:54:51,973 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.30ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.78ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 59.6MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.57ms. Allocated memory is still 167.8MB. Free memory was 59.6MB in the beginning and 56.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.57ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 55.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 288.20ms. Allocated memory is still 167.8MB. Free memory was 55.4MB in the beginning and 40.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2696.51ms. Allocated memory is still 167.8MB. Free memory was 40.3MB in the beginning and 88.9MB in the end (delta: -48.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 66.73ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 83.4MB in the end (delta: 5.5MB). 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: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: 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 3 procedures, 49 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 1507 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 943 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 564 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, InterpolantAutomatonStates: 53, 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, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 110/118 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1580]: Location Invariant Derived location invariant: (((j == 0) && (((long) data + 2) == 0)) || (((0 <= ((long) data + 3)) && (1 <= j)) && (((long) data + 2) <= 0))) - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: ((((0 <= ((long) 2147483647 + data)) && (i == 0)) && (data <= 2147483647)) || ((1 <= i) && (data <= 2147483647))) - InvariantResult [Line: 1557]: Location Invariant Derived location invariant: (((1 <= k) && (data <= 2147483647)) || ((k == 0) && (data <= 2147483647))) - InvariantResult [Line: 1576]: Location Invariant Derived location invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) RESULT: Ultimate proved your program to be correct! [2025-02-08 12:54:51,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE