./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/gj2007.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.i -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 e210f4af0021f1e0c887bbfa24b18aad98424108efaad4cfc57802fd9fd5ce53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:11:52,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:11:52,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:11:52,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:11:52,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:11:52,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:11:52,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:11:52,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:11:52,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:11:52,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:11:52,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:11:52,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:11:52,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:11:52,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:11:52,156 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:11:52,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:11:52,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:11:52,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:11:52,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:11:52,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:11:52,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:11:52,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:11:52,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:11:52,159 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 -> e210f4af0021f1e0c887bbfa24b18aad98424108efaad4cfc57802fd9fd5ce53 [2025-02-08 09:11:52,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:11:52,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:11:52,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:11:52,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:11:52,507 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:11:52,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.i [2025-02-08 09:11:53,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d1d95de7/430cb88acd74499bb5cf1482a1877190/FLAGaf4b186eb [2025-02-08 09:11:53,975 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:11:53,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.i [2025-02-08 09:11:53,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d1d95de7/430cb88acd74499bb5cf1482a1877190/FLAGaf4b186eb [2025-02-08 09:11:54,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d1d95de7/430cb88acd74499bb5cf1482a1877190 [2025-02-08 09:11:54,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:11:54,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:11:54,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:11:54,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:11:54,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:11:54,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35153dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54, skipping insertion in model container [2025-02-08 09:11:54,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:11:54,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:11:54,377 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:11:54,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:11:54,395 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:11:54,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54 WrapperNode [2025-02-08 09:11:54,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:11:54,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:11:54,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:11:54,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:11:54,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,412 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2025-02-08 09:11:54,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:11:54,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:11:54,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:11:54,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:11:54,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,424 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-08 09:11:54,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:11:54,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:11:54,429 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:11:54,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:11:54,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (1/1) ... [2025-02-08 09:11:54,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:11:54,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:54,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:11:54,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:11:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:11:54,509 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:11:54,510 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:11:54,615 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-08 09:11:54,617 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:11:54,625 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:11:54,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:11:54,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:54 BoogieIcfgContainer [2025-02-08 09:11:54,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:11:54,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:11:54,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:11:54,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:11:54,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:11:54" (1/3) ... [2025-02-08 09:11:54,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78607434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:11:54, skipping insertion in model container [2025-02-08 09:11:54,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:54" (2/3) ... [2025-02-08 09:11:54,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78607434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:11:54, skipping insertion in model container [2025-02-08 09:11:54,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:54" (3/3) ... [2025-02-08 09:11:54,634 INFO L128 eAbstractionObserver]: Analyzing ICFG gj2007.i [2025-02-08 09:11:54,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:11:54,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gj2007.i that has 1 procedures, 21 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-02-08 09:11:54,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:11:54,704 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;@65c4a114, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:11:54,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 09:11:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 09:11:54,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:54,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 09:11:54,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:54,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1599703, now seen corresponding path program 1 times [2025-02-08 09:11:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817892905] [2025-02-08 09:11:54,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:54,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 09:11:54,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 09:11:54,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:54,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:11:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817892905] [2025-02-08 09:11:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817892905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:54,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:54,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:11:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975494839] [2025-02-08 09:11:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:54,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:54,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:54,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:54,861 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:54,905 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2025-02-08 09:11:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-08 09:11:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:54,911 INFO L225 Difference]: With dead ends: 44 [2025-02-08 09:11:54,911 INFO L226 Difference]: Without dead ends: 19 [2025-02-08 09:11:54,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:54,915 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:54,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-08 09:11:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 09:11:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-08 09:11:54,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2025-02-08 09:11:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:54,942 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-08 09:11:54,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-08 09:11:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:11:54,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:54,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-08 09:11:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:11:54,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -110129765, now seen corresponding path program 1 times [2025-02-08 09:11:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:54,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043551806] [2025-02-08 09:11:54,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:11:54,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:11:54,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:54,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,014 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-08 09:11:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043551806] [2025-02-08 09:11:55,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043551806] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808572435] [2025-02-08 09:11:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:55,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:55,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:55,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:11:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:11:55,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:11:55,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:55,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:11:55,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:11:55,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:11:55,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808572435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:55,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:11:55,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 09:11:55,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931839400] [2025-02-08 09:11:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:55,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:55,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:55,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:11:55,088 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:55,110 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-02-08 09:11:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:55,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 09:11:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:55,111 INFO L225 Difference]: With dead ends: 19 [2025-02-08 09:11:55,111 INFO L226 Difference]: Without dead ends: 17 [2025-02-08 09:11:55,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-08 09:11:55,112 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:55,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-08 09:11:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-08 09:11:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 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-08 09:11:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-02-08 09:11:55,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 8 [2025-02-08 09:11:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-02-08 09:11:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-02-08 09:11:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 09:11:55,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:55,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2025-02-08 09:11:55,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:11:55,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:55,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 880944558, now seen corresponding path program 1 times [2025-02-08 09:11:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583614241] [2025-02-08 09:11:55,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:55,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 09:11:55,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 09:11:55,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:55,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:11:55,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:55,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583614241] [2025-02-08 09:11:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583614241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:11:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142682157] [2025-02-08 09:11:55,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:55,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:55,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:55,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:55,342 INFO L87 Difference]: Start difference. First operand 17 states and 18 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-08 09:11:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:55,355 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-08 09:11:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:55,355 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-08 09:11:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:55,355 INFO L225 Difference]: With dead ends: 17 [2025-02-08 09:11:55,356 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 09:11:55,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:55,356 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:55,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 09:11:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-02-08 09:11:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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-08 09:11:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-02-08 09:11:55,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2025-02-08 09:11:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:55,359 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-02-08 09:11:55,359 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-08 09:11:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-02-08 09:11:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:11:55,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:55,359 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:55,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:11:55,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:55,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1539515232, now seen corresponding path program 1 times [2025-02-08 09:11:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:55,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350075206] [2025-02-08 09:11:55,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:55,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:11:55,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:11:55,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:55,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,416 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-08 09:11:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350075206] [2025-02-08 09:11:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350075206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871035383] [2025-02-08 09:11:55,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:55,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:55,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:55,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:55,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:11:55,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:11:55,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:11:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 09:11:55,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:55,474 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-08 09:11:55,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:11:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871035383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:55,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:11:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2025-02-08 09:11:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128999262] [2025-02-08 09:11:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:55,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:55,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:11:55,476 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-08 09:11:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:55,481 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2025-02-08 09:11:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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 10 [2025-02-08 09:11:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:55,482 INFO L225 Difference]: With dead ends: 13 [2025-02-08 09:11:55,482 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 09:11:55,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:11:55,483 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:55,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 09:11:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-08 09:11:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-02-08 09:11:55,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2025-02-08 09:11:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:55,485 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-02-08 09:11:55,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-08 09:11:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-02-08 09:11:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:11:55,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:55,486 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:55,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:55,690 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-08 09:11:55,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 480331917, now seen corresponding path program 1 times [2025-02-08 09:11:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491683040] [2025-02-08 09:11:55,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:55,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:11:55,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:11:55,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:55,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,753 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-08 09:11:55,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491683040] [2025-02-08 09:11:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491683040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176583421] [2025-02-08 09:11:55,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:55,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:55,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:55,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:55,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:11:55,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:11:55,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:11:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:55,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 09:11:55,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:55,800 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-08 09:11:55,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:11:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176583421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:11:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2025-02-08 09:11:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872643602] [2025-02-08 09:11:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:55,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:55,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:55,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:11:55,802 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:55,808 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-02-08 09:11:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:55,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 09:11:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:55,809 INFO L225 Difference]: With dead ends: 21 [2025-02-08 09:11:55,809 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 09:11:55,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:11:55,809 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:55,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 09:11:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 09:11:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-02-08 09:11:55,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2025-02-08 09:11:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:55,815 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-02-08 09:11:55,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-02-08 09:11:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 09:11:55,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:55,815 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:55,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 09:11:56,016 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-08 09:11:56,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 862666472, now seen corresponding path program 1 times [2025-02-08 09:11:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:56,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71503772] [2025-02-08 09:11:56,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:56,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:11:56,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:11:56,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:56,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71503772] [2025-02-08 09:11:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71503772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8571818] [2025-02-08 09:11:56,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:56,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:56,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:56,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:11:56,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:11:56,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:11:56,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:56,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:56,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:11:56,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:56,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8571818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:56,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 09:11:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542080196] [2025-02-08 09:11:56,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:56,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:11:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:56,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:11:56,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:11:56,128 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-08 09:11:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:56,155 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-02-08 09:11:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:11:56,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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) Word has length 17 [2025-02-08 09:11:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:56,156 INFO L225 Difference]: With dead ends: 45 [2025-02-08 09:11:56,157 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 09:11:56,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-08 09:11:56,157 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:56,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 09:11:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 09:11:56,160 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-08 09:11:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-02-08 09:11:56,161 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2025-02-08 09:11:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:56,161 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-02-08 09:11:56,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-08 09:11:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-02-08 09:11:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 09:11:56,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:56,164 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1] [2025-02-08 09:11:56,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 09:11:56,364 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,SelfDestructingSolverStorable5 [2025-02-08 09:11:56,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1615704604, now seen corresponding path program 2 times [2025-02-08 09:11:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978983620] [2025-02-08 09:11:56,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:56,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 09:11:56,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:11:56,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-08 09:11:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978983620] [2025-02-08 09:11:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978983620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863869094] [2025-02-08 09:11:56,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:56,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:56,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:56,463 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-08 09:11:56,468 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-08 09:11:56,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 09:11:56,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:11:56,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:56,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:11:56,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:56,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863869094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:56,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 6, 6] total 13 [2025-02-08 09:11:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628371909] [2025-02-08 09:11:56,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:56,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 09:11:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:56,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 09:11:56,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-08 09:11:56,645 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:56,810 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-02-08 09:11:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 09:11:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 09:11:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:56,811 INFO L225 Difference]: With dead ends: 77 [2025-02-08 09:11:56,811 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 09:11:56,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=375, Unknown=0, NotChecked=0, Total=600 [2025-02-08 09:11:56,812 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:56,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 09:11:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 09:11:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-02-08 09:11:56,820 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 29 [2025-02-08 09:11:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:56,820 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-02-08 09:11:56,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-02-08 09:11:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 09:11:56,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:56,821 INFO L218 NwaCegarLoop]: trace histogram [13, 10, 10, 10, 3, 3, 3, 3, 2, 1, 1] [2025-02-08 09:11:56,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 09:11:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:57,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1870172257, now seen corresponding path program 3 times [2025-02-08 09:11:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766348789] [2025-02-08 09:11:57,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:57,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 12 equivalence classes. [2025-02-08 09:11:57,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 59 statements. [2025-02-08 09:11:57,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 09:11:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-08 09:11:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766348789] [2025-02-08 09:11:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766348789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066280458] [2025-02-08 09:11:57,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:57,104 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-08 09:11:57,105 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-08 09:11:57,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 12 equivalence classes. [2025-02-08 09:11:57,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 59 statements. [2025-02-08 09:11:57,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 09:11:57,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:57,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:11:57,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-08 09:11:57,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-08 09:11:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066280458] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:57,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 09:11:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772851918] [2025-02-08 09:11:57,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:57,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:11:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:57,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:11:57,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:57,260 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:57,286 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-02-08 09:11:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 09:11:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-08 09:11:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:57,289 INFO L225 Difference]: With dead ends: 97 [2025-02-08 09:11:57,289 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 09:11:57,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:57,290 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:57,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 09:11:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 09:11:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0842105263157895) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2025-02-08 09:11:57,301 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 59 [2025-02-08 09:11:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:57,301 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2025-02-08 09:11:57,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2025-02-08 09:11:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 09:11:57,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:57,303 INFO L218 NwaCegarLoop]: trace histogram [17, 10, 10, 10, 7, 7, 7, 7, 6, 1, 1] [2025-02-08 09:11:57,309 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-08 09:11:57,503 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,SelfDestructingSolverStorable7 [2025-02-08 09:11:57,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:57,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1318596213, now seen corresponding path program 4 times [2025-02-08 09:11:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15918544] [2025-02-08 09:11:57,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:11:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:57,516 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-08 09:11:57,524 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 09:11:57,524 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:11:57,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 132 proven. 200 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 09:11:57,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15918544] [2025-02-08 09:11:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15918544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153058580] [2025-02-08 09:11:57,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:11:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:57,707 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-08 09:11:57,708 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-08 09:11:57,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-08 09:11:57,742 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 09:11:57,742 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:11:57,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:57,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 09:11:57,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 132 proven. 200 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 09:11:57,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 132 proven. 200 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 09:11:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153058580] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:57,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-02-08 09:11:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387897850] [2025-02-08 09:11:57,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:57,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 09:11:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:57,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 09:11:57,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-02-08 09:11:57,978 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:58,063 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2025-02-08 09:11:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 09:11:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 24 states have internal predecessors, (98), 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 83 [2025-02-08 09:11:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:58,064 INFO L225 Difference]: With dead ends: 197 [2025-02-08 09:11:58,065 INFO L226 Difference]: Without dead ends: 144 [2025-02-08 09:11:58,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-02-08 09:11:58,065 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:58,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-08 09:11:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-08 09:11:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.055944055944056) internal successors, (151), 143 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2025-02-08 09:11:58,074 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 83 [2025-02-08 09:11:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:58,075 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2025-02-08 09:11:58,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2025-02-08 09:11:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-08 09:11:58,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:58,077 INFO L218 NwaCegarLoop]: trace histogram [29, 22, 22, 22, 7, 7, 7, 7, 6, 1, 1] [2025-02-08 09:11:58,083 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-08 09:11:58,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:58,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:11:58,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1046407589, now seen corresponding path program 5 times [2025-02-08 09:11:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907606300] [2025-02-08 09:11:58,279 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:11:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:58,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 131 statements into 24 equivalence classes. [2025-02-08 09:11:58,309 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 09:11:58,310 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-02-08 09:11:58,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-08 09:11:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907606300] [2025-02-08 09:11:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907606300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148044648] [2025-02-08 09:11:58,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:11:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:58,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:58,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 09:11:58,482 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 131 statements into 24 equivalence classes. [2025-02-08 09:11:58,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 09:11:58,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-02-08 09:11:58,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:58,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 09:11:58,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 276 proven. 968 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 09:11:58,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 276 proven. 968 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 09:11:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148044648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:59,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24, 24] total 54 [2025-02-08 09:11:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913102404] [2025-02-08 09:11:59,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-08 09:11:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:59,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-08 09:11:59,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1163, Invalid=1807, Unknown=0, NotChecked=0, Total=2970 [2025-02-08 09:11:59,720 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 55 states, 55 states have (on average 4.2727272727272725) internal successors, (235), 54 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:00,918 INFO L93 Difference]: Finished difference Result 301 states and 340 transitions. [2025-02-08 09:12:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-08 09:12:00,919 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.2727272727272725) internal successors, (235), 54 states have internal predecessors, (235), 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 131 [2025-02-08 09:12:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:00,920 INFO L225 Difference]: With dead ends: 301 [2025-02-08 09:12:00,920 INFO L226 Difference]: Without dead ends: 248 [2025-02-08 09:12:00,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4023, Invalid=7319, Unknown=0, NotChecked=0, Total=11342 [2025-02-08 09:12:00,924 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:00,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 42 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:12:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-08 09:12:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-02-08 09:12:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.0364372469635628) internal successors, (256), 247 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 256 transitions. [2025-02-08 09:12:00,934 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 256 transitions. Word has length 131 [2025-02-08 09:12:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:00,934 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 256 transitions. [2025-02-08 09:12:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.2727272727272725) internal successors, (235), 54 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 256 transitions. [2025-02-08 09:12:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-08 09:12:00,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:00,936 INFO L218 NwaCegarLoop]: trace histogram [54, 46, 46, 46, 8, 8, 8, 8, 7, 1, 1] [2025-02-08 09:12:00,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 09:12:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:01,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:12:01,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1597690922, now seen corresponding path program 6 times [2025-02-08 09:12:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748890874] [2025-02-08 09:12:01,140 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:12:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:01,154 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 233 statements into 48 equivalence classes. [2025-02-08 09:12:01,176 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 109 of 233 statements. [2025-02-08 09:12:01,176 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-02-08 09:12:01,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5044 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-02-08 09:12:01,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748890874] [2025-02-08 09:12:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748890874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295118066] [2025-02-08 09:12:01,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:12:01,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:01,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:01,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 09:12:01,373 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 233 statements into 48 equivalence classes. [2025-02-08 09:12:01,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 109 of 233 statements. [2025-02-08 09:12:01,393 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-02-08 09:12:01,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:01,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:12:01,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5044 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-02-08 09:12:01,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5044 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-02-08 09:12:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295118066] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:02,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-02-08 09:12:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187561580] [2025-02-08 09:12:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 09:12:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:02,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 09:12:02,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:12:02,156 INFO L87 Difference]: Start difference. First operand 248 states and 256 transitions. Second operand has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:02,227 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2025-02-08 09:12:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 09:12:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 233 [2025-02-08 09:12:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:02,229 INFO L225 Difference]: With dead ends: 321 [2025-02-08 09:12:02,229 INFO L226 Difference]: Without dead ends: 320 [2025-02-08 09:12:02,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:12:02,230 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 90 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:02,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 121 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:12:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-08 09:12:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-02-08 09:12:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.0564263322884013) internal successors, (337), 319 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 337 transitions. [2025-02-08 09:12:02,258 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 337 transitions. Word has length 233 [2025-02-08 09:12:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:02,262 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 337 transitions. [2025-02-08 09:12:02,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 337 transitions. [2025-02-08 09:12:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-08 09:12:02,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:02,268 INFO L218 NwaCegarLoop]: trace histogram [63, 46, 46, 46, 17, 17, 17, 17, 16, 1, 1] [2025-02-08 09:12:02,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:02,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:02,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:12:02,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1797970761, now seen corresponding path program 7 times [2025-02-08 09:12:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:02,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894126686] [2025-02-08 09:12:02,471 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 09:12:02,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:02,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 09:12:02,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 09:12:02,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6520 backedges. 1504 proven. 4232 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-02-08 09:12:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894126686] [2025-02-08 09:12:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894126686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242704017] [2025-02-08 09:12:04,172 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 09:12:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:04,174 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:04,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 09:12:04,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 09:12:04,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 09:12:04,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:04,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 09:12:04,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6520 backedges. 1504 proven. 4232 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-02-08 09:12:04,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6520 backedges. 1504 proven. 4232 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-02-08 09:12:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242704017] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:05,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2025-02-08 09:12:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507587868] [2025-02-08 09:12:05,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:05,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 09:12:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:05,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 09:12:05,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 09:12:05,760 INFO L87 Difference]: Start difference. First operand 320 states and 337 transitions. Second operand has 53 states, 53 states have (on average 4.018867924528302) internal successors, (213), 52 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:05,945 INFO L93 Difference]: Finished difference Result 469 states and 506 transitions. [2025-02-08 09:12:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-08 09:12:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.018867924528302) internal successors, (213), 52 states have internal predecessors, (213), 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 287 [2025-02-08 09:12:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:05,949 INFO L225 Difference]: With dead ends: 469 [2025-02-08 09:12:05,949 INFO L226 Difference]: Without dead ends: 336 [2025-02-08 09:12:05,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 525 SyntacticMatches, 44 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 09:12:05,952 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:05,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:12:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-08 09:12:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-08 09:12:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.0537313432835822) internal successors, (353), 335 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 353 transitions. [2025-02-08 09:12:05,963 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 353 transitions. Word has length 287 [2025-02-08 09:12:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:05,963 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 353 transitions. [2025-02-08 09:12:05,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.018867924528302) internal successors, (213), 52 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 353 transitions. [2025-02-08 09:12:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-08 09:12:05,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:05,966 INFO L218 NwaCegarLoop]: trace histogram [67, 50, 50, 50, 17, 17, 17, 17, 16, 1, 1] [2025-02-08 09:12:05,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 09:12:06,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 09:12:06,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:12:06,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1236298297, now seen corresponding path program 8 times [2025-02-08 09:12:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584608206] [2025-02-08 09:12:06,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:06,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 303 statements into 2 equivalence classes. [2025-02-08 09:12:06,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 09:12:06,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:06,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7416 backedges. 0 proven. 2416 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584608206] [2025-02-08 09:12:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584608206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931009321] [2025-02-08 09:12:06,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:06,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:06,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:06,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 09:12:06,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 303 statements into 2 equivalence classes. [2025-02-08 09:12:06,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 09:12:06,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:06,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 09:12:06,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7416 backedges. 0 proven. 2416 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:07,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7416 backedges. 0 proven. 2416 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:07,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931009321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:07,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-08 09:12:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413258116] [2025-02-08 09:12:07,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:07,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 09:12:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:07,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 09:12:07,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 09:12:07,685 INFO L87 Difference]: Start difference. First operand 336 states and 353 transitions. Second operand has 36 states, 35 states have (on average 6.057142857142857) internal successors, (212), 35 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:07,787 INFO L93 Difference]: Finished difference Result 481 states and 533 transitions. [2025-02-08 09:12:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 09:12:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 6.057142857142857) internal successors, (212), 35 states have internal predecessors, (212), 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 303 [2025-02-08 09:12:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:07,790 INFO L225 Difference]: With dead ends: 481 [2025-02-08 09:12:07,790 INFO L226 Difference]: Without dead ends: 480 [2025-02-08 09:12:07,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 09:12:07,794 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 204 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 247 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:12:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-08 09:12:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-02-08 09:12:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.0751565762004176) internal successors, (515), 479 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 515 transitions. [2025-02-08 09:12:07,806 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 515 transitions. Word has length 303 [2025-02-08 09:12:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:07,806 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 515 transitions. [2025-02-08 09:12:07,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 6.057142857142857) internal successors, (212), 35 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 515 transitions. [2025-02-08 09:12:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-08 09:12:07,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:07,810 INFO L218 NwaCegarLoop]: trace histogram [85, 50, 50, 50, 35, 35, 35, 35, 34, 1, 1] [2025-02-08 09:12:07,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:08,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 09:12:08,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:12:08,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash -380996513, now seen corresponding path program 9 times [2025-02-08 09:12:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817853082] [2025-02-08 09:12:08,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:12:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:08,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 411 statements into 52 equivalence classes. [2025-02-08 09:12:08,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) and asserted 347 of 411 statements. [2025-02-08 09:12:08,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2025-02-08 09:12:08,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:08,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817853082] [2025-02-08 09:12:08,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817853082] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547731608] [2025-02-08 09:12:08,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:12:08,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:08,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:08,973 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:08,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 09:12:09,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 411 statements into 52 equivalence classes. [2025-02-08 09:12:09,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) and asserted 347 of 411 statements. [2025-02-08 09:12:09,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2025-02-08 09:12:09,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:09,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 09:12:09,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:09,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547731608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:10,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:10,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2025-02-08 09:12:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524704753] [2025-02-08 09:12:10,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:10,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-02-08 09:12:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:10,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-02-08 09:12:10,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2025-02-08 09:12:10,854 INFO L87 Difference]: Start difference. First operand 480 states and 515 transitions. Second operand has 72 states, 71 states have (on average 6.028169014084507) internal successors, (428), 71 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:11,398 INFO L93 Difference]: Finished difference Result 769 states and 875 transitions. [2025-02-08 09:12:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-02-08 09:12:11,399 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 6.028169014084507) internal successors, (428), 71 states have internal predecessors, (428), 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 411 [2025-02-08 09:12:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:11,403 INFO L225 Difference]: With dead ends: 769 [2025-02-08 09:12:11,403 INFO L226 Difference]: Without dead ends: 768 [2025-02-08 09:12:11,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2025-02-08 09:12:11,405 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 591 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:11,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 499 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:12:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-08 09:12:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2025-02-08 09:12:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.0938722294654497) internal successors, (839), 767 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 839 transitions. [2025-02-08 09:12:11,433 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 839 transitions. Word has length 411 [2025-02-08 09:12:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:11,434 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 839 transitions. [2025-02-08 09:12:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 6.028169014084507) internal successors, (428), 71 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 839 transitions. [2025-02-08 09:12:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-02-08 09:12:11,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:11,448 INFO L218 NwaCegarLoop]: trace histogram [121, 71, 71, 71, 71, 70, 50, 50, 50, 1, 1] [2025-02-08 09:12:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 09:12:11,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:11,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:12:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1950946731, now seen corresponding path program 10 times [2025-02-08 09:12:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:11,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188745033] [2025-02-08 09:12:11,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:12:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:11,663 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 627 statements into 2 equivalence classes. [2025-02-08 09:12:11,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 627 of 627 statements. [2025-02-08 09:12:11,701 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:12:11,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26910 backedges. 0 proven. 21910 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-08 09:12:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188745033] [2025-02-08 09:12:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188745033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854595262] [2025-02-08 09:12:14,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:12:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:14,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:14,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 09:12:14,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 627 statements into 2 equivalence classes. [2025-02-08 09:12:14,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 627 of 627 statements. [2025-02-08 09:12:14,934 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:12:14,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:14,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 09:12:14,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 26910 backedges. 20670 proven. 0 refuted. 0 times theorem prover too weak. 6240 trivial. 0 not checked. [2025-02-08 09:12:17,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:12:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854595262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:12:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [71] total 124 [2025-02-08 09:12:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003635241] [2025-02-08 09:12:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:17,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 09:12:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:17,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 09:12:17,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=11247, Unknown=0, NotChecked=0, Total=15252 [2025-02-08 09:12:17,063 INFO L87 Difference]: Start difference. First operand 768 states and 839 transitions. Second operand has 53 states, 53 states have (on average 5.886792452830188) internal successors, (312), 53 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:17,534 INFO L93 Difference]: Finished difference Result 1063 states and 1183 transitions. [2025-02-08 09:12:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-08 09:12:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.886792452830188) internal successors, (312), 53 states have internal predecessors, (312), 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 627 [2025-02-08 09:12:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:17,536 INFO L225 Difference]: With dead ends: 1063 [2025-02-08 09:12:17,536 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:12:17,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=11247, Unknown=0, NotChecked=0, Total=15252 [2025-02-08 09:12:17,540 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:17,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:12:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:12:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:12:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:12:17,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 627 [2025-02-08 09:12:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:12:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.886792452830188) internal successors, (312), 53 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:12:17,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:12:17,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 09:12:17,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 09:12:17,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 09:12:17,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 09:12:17,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 09:12:17,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 09:12:17,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 09:12:17,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:17,752 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1] [2025-02-08 09:12:17,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:12:18,899 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:12:18,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:12:18 BoogieIcfgContainer [2025-02-08 09:12:18,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:12:18,929 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:12:18,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:12:18,930 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:12:18,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:54" (3/4) ... [2025-02-08 09:12:18,932 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:12:18,943 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 09:12:18,943 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:12:18,943 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:12:18,943 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:12:19,001 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:12:19,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:12:19,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:12:19,002 INFO L158 Benchmark]: Toolchain (without parser) took 24734.75ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 123.6MB in the beginning and 233.2MB in the end (delta: -109.6MB). Peak memory consumption was 287.6MB. Max. memory is 16.1GB. [2025-02-08 09:12:19,002 INFO L158 Benchmark]: CDTParser took 1.32ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:12:19,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 127.03ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 113.0MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:12:19,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.81ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:12:19,003 INFO L158 Benchmark]: Boogie Preprocessor took 14.75ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 111.1MB in the end (delta: 627.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:12:19,004 INFO L158 Benchmark]: IcfgBuilder took 197.12ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 100.1MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:12:19,004 INFO L158 Benchmark]: TraceAbstraction took 24302.02ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 99.5MB in the beginning and 241.6MB in the end (delta: -142.1MB). Peak memory consumption was 300.6MB. Max. memory is 16.1GB. [2025-02-08 09:12:19,004 INFO L158 Benchmark]: Witness Printer took 72.32ms. Allocated memory is still 570.4MB. Free memory was 241.6MB in the beginning and 233.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:12:19,006 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 127.03ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 113.0MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.81ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.75ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 111.1MB in the end (delta: 627.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.12ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 100.1MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24302.02ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 99.5MB in the beginning and 241.6MB in the end (delta: -142.1MB). Peak memory consumption was 300.6MB. Max. memory is 16.1GB. * Witness Printer took 72.32ms. Allocated memory is still 570.4MB. Free memory was 241.6MB in the beginning and 233.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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, 21 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 15, TraceHistogramMax: 121, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 971 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 1477 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1260 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1761 IncrementalHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 217 mSDtfsCounter, 1761 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4020 GetRequests, 3510 SyntacticMatches, 44 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6911 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=768occurred in iteration=14, InterpolantAutomatonStates: 363, 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, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 4431 NumberOfCodeBlocks, 3991 NumberOfCodeBlocksAsserted, 190 NumberOfCheckSat, 5947 ConstructedInterpolants, 0 QuantifiedInterpolants, 16063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3383 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 84651/153042 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((y <= 65) && (65 <= x)) && (50 <= y)) || (((y <= 59) && (50 <= y)) && (59 <= x))) || (((y <= 2147483620) && (93 <= x)) && (50 <= y))) || (((80 <= x) && (y <= 80)) && (50 <= y))) || (((60 <= x) && (y <= 60)) && (50 <= y))) || (((y <= 2147483621) && (94 <= x)) && (50 <= y))) || (((83 <= x) && (y <= 83)) && (50 <= y))) || (((97 <= x) && (y <= 2147483624)) && (50 <= y))) || (((y <= 53) && (50 <= y)) && (53 <= x))) || (((72 <= x) && (50 <= y)) && (y <= 72))) || (((78 <= x) && (y <= 78)) && (50 <= y))) || (((64 <= x) && (y <= 64)) && (50 <= y))) || ((y == 50) && (x == 0))) || (((99 <= x) && (y <= 2147483626)) && (50 <= y))) || (((y <= 79) && (50 <= y)) && (79 <= x))) || (((98 <= x) && (y <= 2147483625)) && (50 <= y))) || (((85 <= x) && (y <= 2147483612)) && (50 <= y))) || (((y <= 76) && (76 <= x)) && (50 <= y))) || (((y <= 2147483619) && (92 <= x)) && (50 <= y))) || (((y <= 73) && (50 <= y)) && (73 <= x))) || (((70 <= x) && (y <= 70)) && (50 <= y))) || (((63 <= x) && (y <= 63)) && (50 <= y))) || (((y <= 75) && (75 <= x)) && (50 <= y))) || (((y <= 56) && (56 <= x)) && (50 <= y))) || (((91 <= x) && (y <= 2147483618)) && (50 <= y))) || (((y <= 55) && (55 <= x)) && (50 <= y))) || (((82 <= x) && (y <= 82)) && (50 <= y))) || (((95 <= x) && (y <= 2147483622)) && (50 <= y))) || (((62 <= x) && (50 <= y)) && (y <= 62))) || (((y <= 2147483614) && (87 <= x)) && (50 <= y))) || (((y <= 2147483623) && (96 <= x)) && (50 <= y))) || (((y <= 2147483615) && (88 <= x)) && (50 <= y))) || ((y == 50) && (1 <= x))) || (((y <= 58) && (58 <= x)) && (50 <= y))) || (((90 <= x) && (y <= 2147483617)) && (50 <= y))) || (((y <= 2147483616) && (89 <= x)) && (50 <= y))) || (((y <= 2147483613) && (86 <= x)) && (50 <= y))) || (((y <= 66) && (66 <= x)) && (50 <= y))) || (((y <= 77) && (50 <= y)) && (77 <= x))) || (((y <= 84) && (84 <= x)) && (50 <= y))) || (((61 <= x) && (y <= 61)) && (50 <= y))) || (((y <= 74) && (74 <= x)) && (50 <= y))) || (((y <= 71) && (71 <= x)) && (50 <= y))) || (((y <= 52) && (52 <= x)) && (50 <= y))) || (((51 <= x) && (50 <= y)) && (y <= 51))) || (((69 <= x) && (y <= 69)) && (50 <= y))) || (((y <= 81) && (81 <= x)) && (50 <= y))) || (((54 <= x) && (50 <= y)) && (y <= 54))) || (((57 <= x) && (y <= 57)) && (50 <= y))) || (((100 <= x) && (y <= 2147483627)) && (50 <= y))) || (((67 <= x) && (y <= 67)) && (50 <= y))) || (((y <= 68) && (68 <= x)) && (50 <= y))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:12:19,023 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