./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/watermelon.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/loops-crafted-1/watermelon.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dda0b992ac1600896503297d86377b482d0a82ded923ea00c7e9ff3fed4db7e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:43:36,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:43:36,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:43:36,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:43:36,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:43:36,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:43:36,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:43:36,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:43:36,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:43:36,745 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:43:36,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:43:36,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:43:36,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:43:36,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:43:36,746 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:43:36,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:43:36,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:43:36,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:43:36,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:43:36,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:43:36,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:43:36,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:43:36,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:43:36,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:43:36,748 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:43:36,749 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dda0b992ac1600896503297d86377b482d0a82ded923ea00c7e9ff3fed4db7e7 [2025-02-06 13:43:36,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:43:36,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:43:36,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:43:37,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:43:37,001 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:43:37,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/watermelon.c [2025-02-06 13:43:38,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45c6ec840/057753dab0504d9aa096fc7eb4342d48/FLAG0eafed245 [2025-02-06 13:43:38,470 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:43:38,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/watermelon.c [2025-02-06 13:43:38,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45c6ec840/057753dab0504d9aa096fc7eb4342d48/FLAG0eafed245 [2025-02-06 13:43:38,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45c6ec840/057753dab0504d9aa096fc7eb4342d48 [2025-02-06 13:43:38,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:43:38,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:43:38,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:43:38,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:43:38,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:43:38,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:38,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da8056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38, skipping insertion in model container [2025-02-06 13:43:38,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:38,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:43:38,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:43:38,961 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:43:38,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:43:38,988 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:43:38,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38 WrapperNode [2025-02-06 13:43:38,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:43:38,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:43:38,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:43:38,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:43:38,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:38,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,013 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 65 [2025-02-06 13:43:39,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:43:39,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:43:39,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:43:39,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:43:39,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,031 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:43:39,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:43:39,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:43:39,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:43:39,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:43:39,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (1/1) ... [2025-02-06 13:43:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:43:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:39,075 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-06 13:43:39,077 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-06 13:43:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:43:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:43:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:43:39,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:43:39,129 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:43:39,131 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:43:39,226 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-06 13:43:39,226 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:43:39,232 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:43:39,232 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:43:39,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:39 BoogieIcfgContainer [2025-02-06 13:43:39,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:43:39,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:43:39,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:43:39,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:43:39,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:43:38" (1/3) ... [2025-02-06 13:43:39,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a13c443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:43:39, skipping insertion in model container [2025-02-06 13:43:39,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:38" (2/3) ... [2025-02-06 13:43:39,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a13c443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:43:39, skipping insertion in model container [2025-02-06 13:43:39,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:39" (3/3) ... [2025-02-06 13:43:39,238 INFO L128 eAbstractionObserver]: Analyzing ICFG watermelon.c [2025-02-06 13:43:39,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:43:39,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG watermelon.c that has 1 procedures, 31 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 13:43:39,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:43:39,286 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;@31bada3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:43:39,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 13:43:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 30 states have internal predecessors, (38), 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-06 13:43:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 13:43:39,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:39,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:43:39,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:39,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2069824990, now seen corresponding path program 1 times [2025-02-06 13:43:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:39,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236221813] [2025-02-06 13:43:39,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:39,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:43:39,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:43:39,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:39,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:39,491 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-06 13:43:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236221813] [2025-02-06 13:43:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236221813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:39,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:43:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667942386] [2025-02-06 13:43:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:39,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:43:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:39,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:43:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:43:39,522 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:39,583 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-02-06 13:43:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:43:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 13:43:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:39,589 INFO L225 Difference]: With dead ends: 42 [2025-02-06 13:43:39,589 INFO L226 Difference]: Without dead ends: 23 [2025-02-06 13:43:39,591 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-06 13:43:39,593 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:39,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-06 13:43:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-02-06 13:43:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-06 13:43:39,636 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 6 [2025-02-06 13:43:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:39,636 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-06 13:43:39,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-06 13:43:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:43:39,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:39,638 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:39,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:43:39,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:39,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -689191456, now seen corresponding path program 1 times [2025-02-06 13:43:39,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:39,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590457396] [2025-02-06 13:43:39,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:39,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:43:39,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:43:39,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:43:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590457396] [2025-02-06 13:43:39,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590457396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170535896] [2025-02-06 13:43:39,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:39,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:39,722 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-06 13:43:39,723 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-06 13:43:39,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:43:39,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:43:39,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:39,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:39,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:43:39,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:39,809 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-06 13:43:39,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:43:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170535896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:43:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 13:43:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886838346] [2025-02-06 13:43:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:39,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:43:39,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:39,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:43:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:43:39,812 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:39,855 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-02-06 13:43:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:43:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 13:43:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:39,856 INFO L225 Difference]: With dead ends: 23 [2025-02-06 13:43:39,856 INFO L226 Difference]: Without dead ends: 22 [2025-02-06 13:43:39,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:43:39,857 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:39,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-06 13:43:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-02-06 13:43:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-06 13:43:39,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2025-02-06 13:43:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-06 13:43:39,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-06 13:43:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:43:39,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:39,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:39,867 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-06 13:43:40,061 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-06 13:43:40,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash -984070910, now seen corresponding path program 1 times [2025-02-06 13:43:40,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952416176] [2025-02-06 13:43:40,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:40,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:43:40,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:43:40,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:40,100 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-06 13:43:40,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:40,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952416176] [2025-02-06 13:43:40,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952416176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:40,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:43:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602318447] [2025-02-06 13:43:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:40,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:43:40,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:40,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:43:40,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:43:40,105 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:40,127 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-02-06 13:43:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:43:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 13:43:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:40,127 INFO L225 Difference]: With dead ends: 26 [2025-02-06 13:43:40,127 INFO L226 Difference]: Without dead ends: 24 [2025-02-06 13:43:40,128 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-06 13:43:40,128 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:40,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-06 13:43:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-06 13:43:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-06 13:43:40,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2025-02-06 13:43:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:40,134 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-06 13:43:40,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-06 13:43:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:43:40,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:40,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:40,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:43:40,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:40,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 109901344, now seen corresponding path program 1 times [2025-02-06 13:43:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:40,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114490744] [2025-02-06 13:43:40,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:40,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:43:40,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:43:40,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:43:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114490744] [2025-02-06 13:43:40,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114490744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026542578] [2025-02-06 13:43:40,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:40,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:40,191 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-06 13:43:40,193 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-06 13:43:40,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:43:40,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:43:40,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:40,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:43:40,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:43:40,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:43:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:43:40,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026542578] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:43:40,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:43:40,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 13:43:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780299524] [2025-02-06 13:43:40,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:43:40,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:43:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:40,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:43:40,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:40,290 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-06 13:43:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:40,328 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-02-06 13:43:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:43:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 13:43:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:40,329 INFO L225 Difference]: With dead ends: 38 [2025-02-06 13:43:40,329 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 13:43:40,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:40,330 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:40,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 13:43:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-02-06 13:43:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 32 states have internal predecessors, (40), 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-06 13:43:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-06 13:43:40,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 10 [2025-02-06 13:43:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:40,333 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-06 13:43:40,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-06 13:43:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-06 13:43:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:43:40,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:40,333 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:40,339 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-06 13:43:40,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:40,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:40,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 990268910, now seen corresponding path program 1 times [2025-02-06 13:43:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847618723] [2025-02-06 13:43:40,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:43:40,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:43:40,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:43:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847618723] [2025-02-06 13:43:40,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847618723] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653602332] [2025-02-06 13:43:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:40,584 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-06 13:43:40,585 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-06 13:43:40,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:43:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:43:40,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:40,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:43:40,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:43:40,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:43:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653602332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:43:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-02-06 13:43:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033061362] [2025-02-06 13:43:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:43:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:40,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:43:40,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:40,749 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:40,775 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-02-06 13:43:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:43:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 13:43:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:40,776 INFO L225 Difference]: With dead ends: 44 [2025-02-06 13:43:40,776 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 13:43:40,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:40,777 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:40,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 13:43:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 13:43:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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-06 13:43:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-02-06 13:43:40,781 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2025-02-06 13:43:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:40,781 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-02-06 13:43:40,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-02-06 13:43:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:43:40,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:40,782 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:40,789 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-06 13:43:40,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:40,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:40,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1519551556, now seen corresponding path program 1 times [2025-02-06 13:43:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589011305] [2025-02-06 13:43:40,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:40,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:43:40,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:43:40,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:43:41,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:41,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589011305] [2025-02-06 13:43:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589011305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:41,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:41,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:43:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416750255] [2025-02-06 13:43:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:41,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:43:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:41,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:43:41,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:43:41,017 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:41,031 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-02-06 13:43:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:43:41,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 13:43:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:41,032 INFO L225 Difference]: With dead ends: 46 [2025-02-06 13:43:41,032 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 13:43:41,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 13:43:41,033 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 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-06 13:43:41,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 13:43:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 13:43:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 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-06 13:43:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-02-06 13:43:41,036 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2025-02-06 13:43:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:41,036 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-06 13:43:41,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-02-06 13:43:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:43:41,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:41,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:41,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:43:41,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:41,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2067030534, now seen corresponding path program 1 times [2025-02-06 13:43:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705106791] [2025-02-06 13:43:41,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:41,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:43:41,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:43:41,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:41,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:43:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705106791] [2025-02-06 13:43:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705106791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221317630] [2025-02-06 13:43:41,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:41,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:41,082 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-06 13:43:41,086 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-06 13:43:41,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:43:41,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:43:41,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:41,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:41,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:43:41,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:43:41,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:43:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:43:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221317630] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:43:41,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:43:41,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2025-02-06 13:43:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126973654] [2025-02-06 13:43:41,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:43:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:43:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:41,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:43:41,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:43:41,275 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-06 13:43:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:41,342 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-02-06 13:43:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:43:41,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 13:43:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:41,343 INFO L225 Difference]: With dead ends: 45 [2025-02-06 13:43:41,343 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:43:41,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:43:41,344 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:41,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:43:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:43:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 13:43:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-06 13:43:41,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2025-02-06 13:43:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:41,350 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-06 13:43:41,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-06 13:43:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-06 13:43:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:43:41,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:41,351 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-02-06 13:43:41,363 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-06 13:43:41,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 13:43:41,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:41,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -627465118, now seen corresponding path program 2 times [2025-02-06 13:43:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:41,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655844882] [2025-02-06 13:43:41,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:43:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:41,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 13:43:41,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-02-06 13:43:41,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:43:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:43:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655844882] [2025-02-06 13:43:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655844882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344994782] [2025-02-06 13:43:41,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:43:41,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:41,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:41,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:43:41,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:43:41,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 13:43:41,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-02-06 13:43:41,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:43:41,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:41,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:43:41,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:43:41,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:43:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:43:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344994782] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:43:41,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:43:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 13:43:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650419998] [2025-02-06 13:43:41,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:43:41,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:43:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:41,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:43:41,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:43:41,730 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-06 13:43:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:41,764 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-02-06 13:43:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:43:41,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 13:43:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:41,765 INFO L225 Difference]: With dead ends: 32 [2025-02-06 13:43:41,765 INFO L226 Difference]: Without dead ends: 31 [2025-02-06 13:43:41,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:43:41,766 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:41,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-06 13:43:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-02-06 13:43:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-02-06 13:43:41,770 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2025-02-06 13:43:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:41,770 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-02-06 13:43:41,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-06 13:43:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-02-06 13:43:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:43:41,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:41,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:41,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:43:41,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:41,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:41,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash -141626250, now seen corresponding path program 1 times [2025-02-06 13:43:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:41,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489326424] [2025-02-06 13:43:41,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:41,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:43:41,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:43:41,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:41,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:43:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489326424] [2025-02-06 13:43:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489326424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338355963] [2025-02-06 13:43:42,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:42,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:43:42,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:43:42,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:43:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:43:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:42,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:43:42,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:43:42,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:43:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:43:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338355963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:43:42,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:43:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 13:43:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922246246] [2025-02-06 13:43:42,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:43:42,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:43:42,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:42,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:43:42,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:42,102 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-06 13:43:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:42,127 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-02-06 13:43:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:43:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 13:43:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:42,128 INFO L225 Difference]: With dead ends: 33 [2025-02-06 13:43:42,128 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:43:42,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:42,129 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:42,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:43:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 13:43:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:43:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-02-06 13:43:42,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2025-02-06 13:43:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:42,133 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-02-06 13:43:42,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-06 13:43:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-02-06 13:43:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:43:42,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:42,134 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:42,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:43:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 13:43:42,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:43:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1572082242, now seen corresponding path program 2 times [2025-02-06 13:43:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188683199] [2025-02-06 13:43:42,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:43:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:42,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 13:43:42,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 31 statements. [2025-02-06 13:43:42,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:43:42,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 13:43:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188683199] [2025-02-06 13:43:42,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188683199] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318228258] [2025-02-06 13:43:42,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:43:42,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:42,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:42,480 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:43:42,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:43:42,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 13:43:42,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 31 statements. [2025-02-06 13:43:42,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:43:42,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:42,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:43:42,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 13:43:42,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:43:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 13:43:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318228258] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:43:42,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:43:42,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-02-06 13:43:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184437898] [2025-02-06 13:43:42,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:43:42,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:43:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:42,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:43:42,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:43:42,654 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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-06 13:43:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:42,707 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-02-06 13:43:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:43:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 13:43:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:42,708 INFO L225 Difference]: With dead ends: 32 [2025-02-06 13:43:42,708 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:43:42,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:43:42,708 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:42,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:43:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:43:42,709 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-06 13:43:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:43:42,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-02-06 13:43:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:42,709 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:43:42,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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-06 13:43:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:43:42,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:43:42,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 13:43:42,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 13:43:42,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 13:43:42,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 13:43:42,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:43:42,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:42,917 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:43:42,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:43:42,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:43:42,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:43:42 BoogieIcfgContainer [2025-02-06 13:43:42,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:43:42,999 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:43:42,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:43:42,999 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:43:42,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:39" (3/4) ... [2025-02-06 13:43:43,001 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:43:43,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 13:43:43,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:43:43,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:43:43,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:43:43,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:43:43,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:43:43,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:43:43,060 INFO L158 Benchmark]: Toolchain (without parser) took 4235.28ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 90.0MB in the end (delta: 23.2MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.26ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.24ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.2MB in the end (delta: 854.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: Boogie Preprocessor took 25.92ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: IcfgBuilder took 189.26ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 87.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: TraceAbstraction took 3764.83ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 95.5MB in the end (delta: -9.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:43:43,060 INFO L158 Benchmark]: Witness Printer took 60.26ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 90.0MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:43:43,062 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.26ms. Allocated memory is still 201.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.26ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.24ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.2MB in the end (delta: 854.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.92ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 189.26ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 87.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3764.83ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 95.5MB in the end (delta: -9.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.26ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 90.0MB in the end (delta: 5.4MB). There was no memory consumed. 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 152 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 272 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210 SizeOfPredicates, 7 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 173/247 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 4 specifications checked. All of them hold - InvariantResult [Line: 43]: Location Invariant Derived location invariant: (((i == 0) && (w <= 9999999)) || (((i <= 2147483645) && (2 <= i)) && (w <= 9999999))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((((2 <= i) && (i <= 2147483645)) && (w <= 9999999)) && (w == w)) || ((((4 <= w) && (w <= 9999999)) && (w == w)) && (i == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:43:43,076 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