./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/nr4.c --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/array-tiling/nr4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:49:55,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:49:55,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:49:55,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:49:55,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:49:55,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:49:55,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:49:55,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:49:55,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:49:55,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:49:55,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:49:55,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:49:55,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:49:55,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:49:55,286 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:49:55,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:49:55,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:49:55,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:49:55,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:49:55,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:49:55,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:49:55,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:49:55,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:49:55,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:49:55,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:55,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:49:55,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:49:55,289 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 -> 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 [2025-02-08 08:49:55,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:49:55,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:49:55,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:49:55,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:49:55,526 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:49:55,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr4.c [2025-02-08 08:49:56,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3232a4edf/c0e99c0ea308486ebec89b52e0a23159/FLAG8df88d547 [2025-02-08 08:49:56,861 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:49:56,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr4.c [2025-02-08 08:49:56,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3232a4edf/c0e99c0ea308486ebec89b52e0a23159/FLAG8df88d547 [2025-02-08 08:49:57,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3232a4edf/c0e99c0ea308486ebec89b52e0a23159 [2025-02-08 08:49:57,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:49:57,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:49:57,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:49:57,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:49:57,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:49:57,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a11529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57, skipping insertion in model container [2025-02-08 08:49:57,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:49:57,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:49:57,334 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:49:57,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:49:57,361 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:49:57,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57 WrapperNode [2025-02-08 08:49:57,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:49:57,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:49:57,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:49:57,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:49:57,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,389 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-02-08 08:49:57,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:49:57,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:49:57,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:49:57,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:49:57,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,404 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-08 08:49:57,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:49:57,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:49:57,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:49:57,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:49:57,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (1/1) ... [2025-02-08 08:49:57,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:57,440 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 08:49:57,443 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 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:49:57,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:49:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:49:57,515 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:49:57,516 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:49:57,692 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-08 08:49:57,692 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:49:57,699 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:49:57,699 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:49:57,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:57 BoogieIcfgContainer [2025-02-08 08:49:57,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:49:57,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:49:57,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:49:57,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:49:57,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:49:57" (1/3) ... [2025-02-08 08:49:57,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e18c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:49:57, skipping insertion in model container [2025-02-08 08:49:57,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:57" (2/3) ... [2025-02-08 08:49:57,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e18c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:49:57, skipping insertion in model container [2025-02-08 08:49:57,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:57" (3/3) ... [2025-02-08 08:49:57,711 INFO L128 eAbstractionObserver]: Analyzing ICFG nr4.c [2025-02-08 08:49:57,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:49:57,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr4.c that has 1 procedures, 52 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-08 08:49:57,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:49:57,779 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;@4406edcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:49:57,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:49:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 51 states have internal predecessors, (60), 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 08:49:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:49:57,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:57,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:57,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash -670549157, now seen corresponding path program 1 times [2025-02-08 08:49:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806600208] [2025-02-08 08:49:57,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:57,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:49:57,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:49:57,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:57,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:57,913 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 08:49:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806600208] [2025-02-08 08:49:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806600208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:49:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376703444] [2025-02-08 08:49:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:57,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:49:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:57,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:49:57,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:49:57,933 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 51 states have internal predecessors, (60), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:57,942 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-02-08 08:49:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:49:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:49:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:57,949 INFO L225 Difference]: With dead ends: 99 [2025-02-08 08:49:57,949 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 08:49:57,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:49:57,958 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:57,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 08:49:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 08:49:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 states have internal predecessors, (52), 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 08:49:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-08 08:49:58,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2025-02-08 08:49:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,015 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-08 08:49:58,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-08 08:49:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:49:58,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:49:58,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -670519366, now seen corresponding path program 1 times [2025-02-08 08:49:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919698289] [2025-02-08 08:49:58,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:49:58,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:49:58,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,247 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 08:49:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919698289] [2025-02-08 08:49:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919698289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422793046] [2025-02-08 08:49:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:58,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,249 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,279 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-08 08:49:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:49:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,281 INFO L225 Difference]: With dead ends: 48 [2025-02-08 08:49:58,281 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 08:49:58,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,282 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 08:49:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 08:49:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.59375) internal successors, (51), 46 states have internal predecessors, (51), 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 08:49:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 08:49:58,288 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 7 [2025-02-08 08:49:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,288 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 08:49:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 08:49:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 08:49:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:49:58,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:49:58,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash 688736151, now seen corresponding path program 1 times [2025-02-08 08:49:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558581726] [2025-02-08 08:49:58,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:49:58,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:49:58,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,546 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 08:49:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558581726] [2025-02-08 08:49:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558581726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:49:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476621052] [2025-02-08 08:49:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:49:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:49:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:49:58,550 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 08:49:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,567 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-02-08 08:49:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 08:49:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,568 INFO L225 Difference]: With dead ends: 47 [2025-02-08 08:49:58,569 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 08:49:58,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:49:58,569 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 43 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 08:49:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 08:49:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 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 08:49:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-08 08:49:58,573 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2025-02-08 08:49:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,573 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-08 08:49:58,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 08:49:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-08 08:49:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:49:58,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:49:58,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1079916439, now seen corresponding path program 1 times [2025-02-08 08:49:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987337542] [2025-02-08 08:49:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:49:58,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:49:58,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,602 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 08:49:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987337542] [2025-02-08 08:49:58,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987337542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293668118] [2025-02-08 08:49:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:49:58,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:49:58,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:58,603 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,634 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-08 08:49:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:49:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 08:49:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,635 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:58,635 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 08:49:58,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:58,636 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 08:49:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2025-02-08 08:49:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 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 08:49:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 08:49:58,640 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2025-02-08 08:49:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,640 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 08:49:58,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 08:49:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:49:58,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:49:58,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -882304951, now seen corresponding path program 1 times [2025-02-08 08:49:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399244236] [2025-02-08 08:49:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:49:58,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:49:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,666 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 08:49:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399244236] [2025-02-08 08:49:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399244236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:49:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625094328] [2025-02-08 08:49:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:49:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:49:58,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:58,668 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,720 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-08 08:49:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:49:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 08:49:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,722 INFO L225 Difference]: With dead ends: 71 [2025-02-08 08:49:58,722 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 08:49:58,722 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 08:49:58,723 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 57 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 08:49:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-08 08:49:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 64 states have internal predecessors, (78), 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 08:49:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-02-08 08:49:58,727 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 12 [2025-02-08 08:49:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,727 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-02-08 08:49:58,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-02-08 08:49:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:49:58,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:49:58,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1786500665, now seen corresponding path program 1 times [2025-02-08 08:49:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071185696] [2025-02-08 08:49:58,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:49:58,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:49:58,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,781 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 08:49:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071185696] [2025-02-08 08:49:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071185696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533513397] [2025-02-08 08:49:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,783 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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 08:49:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,865 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-02-08 08:49:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 08:49:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,866 INFO L225 Difference]: With dead ends: 81 [2025-02-08 08:49:58,867 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 08:49:58,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,867 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 08:49:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-02-08 08:49:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 73 states have internal predecessors, (88), 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 08:49:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-02-08 08:49:58,875 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 14 [2025-02-08 08:49:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-02-08 08:49:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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 08:49:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-02-08 08:49:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:49:58,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:49:58,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1371504718, now seen corresponding path program 1 times [2025-02-08 08:49:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921671658] [2025-02-08 08:49:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:49:58,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:49:58,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,915 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 08:49:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921671658] [2025-02-08 08:49:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921671658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623371140] [2025-02-08 08:49:58,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:58,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:58,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,917 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 08:49:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,951 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2025-02-08 08:49:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 08:49:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,953 INFO L225 Difference]: With dead ends: 83 [2025-02-08 08:49:58,953 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 08:49:58,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,954 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 08:49:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 08:49:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 80 states have internal predecessors, (96), 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 08:49:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-02-08 08:49:58,959 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 16 [2025-02-08 08:49:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,959 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-02-08 08:49:58,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 08:49:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-02-08 08:49:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:49:58,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:49:58,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1593415025, now seen corresponding path program 1 times [2025-02-08 08:49:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065692030] [2025-02-08 08:49:58,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:49:58,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:49:58,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,022 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 08:49:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065692030] [2025-02-08 08:49:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065692030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666900651] [2025-02-08 08:49:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:59,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,024 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,068 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-08 08:49:59,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 08:49:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,069 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:59,069 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:49:59,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,069 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 109 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:49:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-02-08 08:49:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 95 states have internal predecessors, (120), 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 08:49:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2025-02-08 08:49:59,079 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 17 [2025-02-08 08:49:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,080 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2025-02-08 08:49:59,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 08:49:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2025-02-08 08:49:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:49:59,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:49:59,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1448443426, now seen corresponding path program 1 times [2025-02-08 08:49:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603151700] [2025-02-08 08:49:59,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:49:59,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:49:59,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:49:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603151700] [2025-02-08 08:49:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603151700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160574130] [2025-02-08 08:49:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:59,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,116 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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 08:49:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,162 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-08 08:49:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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) Word has length 20 [2025-02-08 08:49:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,163 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:59,163 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:49:59,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,164 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:49:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-08 08:49:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 97 states have internal predecessors, (122), 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 08:49:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2025-02-08 08:49:59,169 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 20 [2025-02-08 08:49:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,169 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2025-02-08 08:49:59,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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 08:49:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2025-02-08 08:49:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:49:59,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:49:59,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -796236211, now seen corresponding path program 1 times [2025-02-08 08:49:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686980629] [2025-02-08 08:49:59,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:49:59,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:49:59,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:49:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686980629] [2025-02-08 08:49:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686980629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:49:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189723779] [2025-02-08 08:49:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:59,270 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 08:49:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,318 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2025-02-08 08:49:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 08:49:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,319 INFO L225 Difference]: With dead ends: 117 [2025-02-08 08:49:59,319 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:49:59,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:59,320 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 84 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 50 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:49:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-08 08:49:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 97 states have internal predecessors, (121), 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 08:49:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2025-02-08 08:49:59,324 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 23 [2025-02-08 08:49:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,324 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2025-02-08 08:49:59,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 08:49:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2025-02-08 08:49:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:49:59,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:49:59,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -935439524, now seen corresponding path program 1 times [2025-02-08 08:49:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877588113] [2025-02-08 08:49:59,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:49:59,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:49:59,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877588113] [2025-02-08 08:49:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877588113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457167641] [2025-02-08 08:49:59,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:59,401 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 08:49:59,406 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 08:49:59,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:49:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:49:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:49:59,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:59,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:49:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457167641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:49:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 08:49:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281278144] [2025-02-08 08:49:59,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:49:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:49:59,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:59,523 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 08:49:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,611 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2025-02-08 08:49:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:49:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2025-02-08 08:49:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,612 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:59,612 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:49:59,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:59,612 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 82 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:49:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-08 08:49:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 96 states have internal predecessors, (117), 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 08:49:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-02-08 08:49:59,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 23 [2025-02-08 08:49:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,617 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-08 08:49:59,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 08:49:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-02-08 08:49:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:49:59,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,623 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 08:49:59,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:49:59,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1066145822, now seen corresponding path program 1 times [2025-02-08 08:49:59,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240398719] [2025-02-08 08:49:59,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:49:59,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:49:59,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:49:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240398719] [2025-02-08 08:49:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240398719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:59,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380673431] [2025-02-08 08:49:59,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:59,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,860 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 08:49:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,916 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-02-08 08:49:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 08:49:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,917 INFO L225 Difference]: With dead ends: 100 [2025-02-08 08:49:59,919 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 08:49:59,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,919 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 08:49:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-08 08:49:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 96 states have internal predecessors, (115), 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 08:49:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2025-02-08 08:49:59,924 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2025-02-08 08:49:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,924 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2025-02-08 08:49:59,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 08:49:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2025-02-08 08:49:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:49:59,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:49:59,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1931049028, now seen corresponding path program 1 times [2025-02-08 08:49:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871839107] [2025-02-08 08:49:59,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:49:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:49:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:49:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871839107] [2025-02-08 08:49:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871839107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378133303] [2025-02-08 08:49:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:59,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,967 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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 08:50:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:00,005 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2025-02-08 08:50:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:00,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-02-08 08:50:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:00,006 INFO L225 Difference]: With dead ends: 97 [2025-02-08 08:50:00,006 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 08:50:00,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:00,006 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:00,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 08:50:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-02-08 08:50:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 84 states have internal predecessors, (101), 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 08:50:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-02-08 08:50:00,014 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2025-02-08 08:50:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:00,014 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-02-08 08:50:00,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 08:50:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-02-08 08:50:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 08:50:00,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:00,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:00,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:50:00,015 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:00,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:00,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1958649321, now seen corresponding path program 1 times [2025-02-08 08:50:00,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:00,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364206418] [2025-02-08 08:50:00,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:00,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:50:00,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:50:00,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:00,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364206418] [2025-02-08 08:50:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364206418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650407605] [2025-02-08 08:50:00,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:00,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:00,072 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 08:50:00,073 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 08:50:00,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:50:00,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:50:00,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:00,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:00,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:00,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650407605] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:00,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 08:50:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572930370] [2025-02-08 08:50:00,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:00,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:00,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:00,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:00,181 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 08:50:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:00,245 INFO L93 Difference]: Finished difference Result 195 states and 233 transitions. [2025-02-08 08:50:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:50:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 28 [2025-02-08 08:50:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:00,246 INFO L225 Difference]: With dead ends: 195 [2025-02-08 08:50:00,246 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 08:50:00,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:00,247 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:00,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 223 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 08:50:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2025-02-08 08:50:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 124 states have internal predecessors, (153), 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 08:50:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2025-02-08 08:50:00,251 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 28 [2025-02-08 08:50:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:00,251 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2025-02-08 08:50:00,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 08:50:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2025-02-08 08:50:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 08:50:00,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:00,252 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:00,258 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 08:50:00,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,453 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:00,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash 704938423, now seen corresponding path program 2 times [2025-02-08 08:50:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:00,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457835496] [2025-02-08 08:50:00,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:00,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 08:50:00,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:00,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:00,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 08:50:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457835496] [2025-02-08 08:50:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457835496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374121762] [2025-02-08 08:50:00,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:00,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:00,522 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 08:50:00,523 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 08:50:00,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 08:50:00,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:00,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:00,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:50:00,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:00,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374121762] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:00,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:00,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 12 [2025-02-08 08:50:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102958683] [2025-02-08 08:50:00,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:00,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:50:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:00,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:50:00,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:00,701 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 08:50:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:01,012 INFO L93 Difference]: Finished difference Result 297 states and 391 transitions. [2025-02-08 08:50:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 08:50:01,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 46 [2025-02-08 08:50:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:01,013 INFO L225 Difference]: With dead ends: 297 [2025-02-08 08:50:01,013 INFO L226 Difference]: Without dead ends: 221 [2025-02-08 08:50:01,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-02-08 08:50:01,014 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 215 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:01,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 175 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:50:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-08 08:50:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 208. [2025-02-08 08:50:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 195 states have (on average 1.435897435897436) internal successors, (280), 207 states have internal predecessors, (280), 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 08:50:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2025-02-08 08:50:01,020 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 46 [2025-02-08 08:50:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:01,020 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2025-02-08 08:50:01,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 08:50:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2025-02-08 08:50:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 08:50:01,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,021 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:01,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:01,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1291309618, now seen corresponding path program 1 times [2025-02-08 08:50:01,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027940705] [2025-02-08 08:50:01,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 08:50:01,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 08:50:01,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 08:50:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027940705] [2025-02-08 08:50:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027940705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970451327] [2025-02-08 08:50:01,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:01,307 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 08:50:01,315 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 08:50:01,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 08:50:01,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 08:50:01,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:50:01,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:50:01,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970451327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:01,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:01,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 08:50:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281003716] [2025-02-08 08:50:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:01,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:01,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:01,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:50:01,534 INFO L87 Difference]: Start difference. First operand 208 states and 280 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 08:50:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:01,654 INFO L93 Difference]: Finished difference Result 364 states and 489 transitions. [2025-02-08 08:50:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:50:01,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 56 [2025-02-08 08:50:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:01,656 INFO L225 Difference]: With dead ends: 364 [2025-02-08 08:50:01,656 INFO L226 Difference]: Without dead ends: 205 [2025-02-08 08:50:01,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:50:01,657 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 55 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:01,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 218 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-08 08:50:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 195. [2025-02-08 08:50:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.3770491803278688) internal successors, (252), 194 states have internal predecessors, (252), 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 08:50:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 252 transitions. [2025-02-08 08:50:01,666 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 252 transitions. Word has length 56 [2025-02-08 08:50:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:01,667 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 252 transitions. [2025-02-08 08:50:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 08:50:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 252 transitions. [2025-02-08 08:50:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 08:50:01,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,667 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:01,868 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,SelfDestructingSolverStorable15 [2025-02-08 08:50:01,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1612024333, now seen corresponding path program 1 times [2025-02-08 08:50:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809309255] [2025-02-08 08:50:01,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 08:50:01,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 08:50:01,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 08:50:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809309255] [2025-02-08 08:50:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809309255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477418047] [2025-02-08 08:50:01,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:01,964 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 08:50:01,976 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 08:50:02,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 08:50:02,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 08:50:02,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:02,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 08:50:02,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 08:50:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477418047] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:02,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:50:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184939601] [2025-02-08 08:50:02,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:02,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:02,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:02,220 INFO L87 Difference]: Start difference. First operand 195 states and 252 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 08:50:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,404 INFO L93 Difference]: Finished difference Result 210 states and 272 transitions. [2025-02-08 08:50:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:02,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 56 [2025-02-08 08:50:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,406 INFO L225 Difference]: With dead ends: 210 [2025-02-08 08:50:02,406 INFO L226 Difference]: Without dead ends: 207 [2025-02-08 08:50:02,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:02,406 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 149 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:50:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-08 08:50:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-02-08 08:50:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 195 states have (on average 1.317948717948718) internal successors, (257), 206 states have internal predecessors, (257), 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 08:50:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2025-02-08 08:50:02,413 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 56 [2025-02-08 08:50:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,413 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2025-02-08 08:50:02,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 08:50:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2025-02-08 08:50:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 08:50:02,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,414 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:02,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:50:02,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1566853225, now seen corresponding path program 1 times [2025-02-08 08:50:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066833605] [2025-02-08 08:50:02,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 08:50:02,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:50:02,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 08:50:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066833605] [2025-02-08 08:50:02,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066833605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:02,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041147210] [2025-02-08 08:50:02,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:02,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:02,698 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 08:50:02,703 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 08:50:02,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 08:50:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:50:02,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:02,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 08:50:02,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041147210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 08:50:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124669937] [2025-02-08 08:50:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:02,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:02,817 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 08:50:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,901 INFO L93 Difference]: Finished difference Result 209 states and 257 transitions. [2025-02-08 08:50:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 57 [2025-02-08 08:50:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,902 INFO L225 Difference]: With dead ends: 209 [2025-02-08 08:50:02,902 INFO L226 Difference]: Without dead ends: 204 [2025-02-08 08:50:02,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:02,902 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-08 08:50:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-08 08:50:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 195 states have (on average 1.241025641025641) internal successors, (242), 203 states have internal predecessors, (242), 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 08:50:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 242 transitions. [2025-02-08 08:50:02,909 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 242 transitions. Word has length 57 [2025-02-08 08:50:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 242 transitions. [2025-02-08 08:50:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 08:50:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 242 transitions. [2025-02-08 08:50:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 08:50:02,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,910 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:50:03,110 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,SelfDestructingSolverStorable17 [2025-02-08 08:50:03,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1327809713, now seen corresponding path program 1 times [2025-02-08 08:50:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745433602] [2025-02-08 08:50:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 08:50:03,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 08:50:03,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745433602] [2025-02-08 08:50:03,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745433602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:03,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:03,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405139151] [2025-02-08 08:50:03,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:03,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:03,180 INFO L87 Difference]: Start difference. First operand 204 states and 242 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 08:50:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,244 INFO L93 Difference]: Finished difference Result 206 states and 242 transitions. [2025-02-08 08:50:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 58 [2025-02-08 08:50:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,247 INFO L225 Difference]: With dead ends: 206 [2025-02-08 08:50:03,247 INFO L226 Difference]: Without dead ends: 204 [2025-02-08 08:50:03,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:03,248 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-08 08:50:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-08 08:50:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 195 states have (on average 1.2205128205128206) internal successors, (238), 203 states have internal predecessors, (238), 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 08:50:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 238 transitions. [2025-02-08 08:50:03,256 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 238 transitions. Word has length 58 [2025-02-08 08:50:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,256 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 238 transitions. [2025-02-08 08:50:03,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 08:50:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 238 transitions. [2025-02-08 08:50:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 08:50:03,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,256 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:50:03,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 375758315, now seen corresponding path program 1 times [2025-02-08 08:50:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542822072] [2025-02-08 08:50:03,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 08:50:03,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:50:03,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542822072] [2025-02-08 08:50:03,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542822072] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133451632] [2025-02-08 08:50:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:03,348 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 08:50:03,349 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 08:50:03,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 08:50:03,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:50:03,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:03,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:03,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133451632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:03,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 08:50:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780365600] [2025-02-08 08:50:03,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:03,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:50:03,431 INFO L87 Difference]: Start difference. First operand 204 states and 238 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 08:50:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,479 INFO L93 Difference]: Finished difference Result 204 states and 238 transitions. [2025-02-08 08:50:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:03,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 66 [2025-02-08 08:50:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,481 INFO L225 Difference]: With dead ends: 204 [2025-02-08 08:50:03,481 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 08:50:03,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:50:03,481 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 107 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 08:50:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 08:50:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 195 states have (on average 1.2153846153846153) internal successors, (237), 202 states have internal predecessors, (237), 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 08:50:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2025-02-08 08:50:03,490 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 66 [2025-02-08 08:50:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2025-02-08 08:50:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 08:50:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2025-02-08 08:50:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 08:50:03,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,491 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:03,500 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 08:50:03,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,691 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash 236555002, now seen corresponding path program 2 times [2025-02-08 08:50:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736918931] [2025-02-08 08:50:03,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 08:50:03,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:50:03,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:03,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736918931] [2025-02-08 08:50:03,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736918931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363252375] [2025-02-08 08:50:03,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:03,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:03,795 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 08:50:03,796 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 08:50:03,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 08:50:03,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:50:03,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:03,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:50:03,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 08:50:03,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:03,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363252375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:03,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-02-08 08:50:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376607395] [2025-02-08 08:50:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:50:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:50:03,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:03,962 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 08:50:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,056 INFO L93 Difference]: Finished difference Result 203 states and 237 transitions. [2025-02-08 08:50:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 66 [2025-02-08 08:50:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,058 INFO L225 Difference]: With dead ends: 203 [2025-02-08 08:50:04,058 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 08:50:04,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:04,058 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 08:50:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-08 08:50:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 195 states have (on average 1.1641025641025642) internal successors, (227), 200 states have internal predecessors, (227), 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 08:50:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2025-02-08 08:50:04,067 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 66 [2025-02-08 08:50:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,067 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2025-02-08 08:50:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 08:50:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2025-02-08 08:50:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 08:50:04,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,068 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,076 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 08:50:04,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,269 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:04,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1236394151, now seen corresponding path program 1 times [2025-02-08 08:50:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:04,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781424892] [2025-02-08 08:50:04,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 08:50:04,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 08:50:04,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:04,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781424892] [2025-02-08 08:50:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781424892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74068090] [2025-02-08 08:50:04,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:04,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:04,334 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 08:50:04,339 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 08:50:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 08:50:04,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 08:50:04,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:04,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:04,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:50:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74068090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:04,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 08:50:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337780247] [2025-02-08 08:50:04,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:50:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:04,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:50:04,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:04,453 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 08:50:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,603 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2025-02-08 08:50:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:50:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 67 [2025-02-08 08:50:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,604 INFO L225 Difference]: With dead ends: 223 [2025-02-08 08:50:04,604 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 08:50:04,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:04,605 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 171 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 08:50:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-02-08 08:50:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 216 states have (on average 1.162037037037037) internal successors, (251), 221 states have internal predecessors, (251), 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 08:50:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 251 transitions. [2025-02-08 08:50:04,611 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 251 transitions. Word has length 67 [2025-02-08 08:50:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,611 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 251 transitions. [2025-02-08 08:50:04,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 08:50:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 251 transitions. [2025-02-08 08:50:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 08:50:04,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,612 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:50:04,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,812 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:04,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1256729536, now seen corresponding path program 2 times [2025-02-08 08:50:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852748257] [2025-02-08 08:50:04,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:04,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 08:50:04,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 67 statements. [2025-02-08 08:50:04,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:04,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-08 08:50:04,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:04,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852748257] [2025-02-08 08:50:04,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852748257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:04,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:04,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701359010] [2025-02-08 08:50:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:04,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:04,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:04,836 INFO L87 Difference]: Start difference. First operand 222 states and 251 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,871 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2025-02-08 08:50:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:04,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-08 08:50:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,872 INFO L225 Difference]: With dead ends: 222 [2025-02-08 08:50:04,872 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 08:50:04,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 08:50:04,873 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 08:50:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-08 08:50:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 216 states have (on average 1.1157407407407407) internal successors, (241), 219 states have internal predecessors, (241), 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 08:50:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2025-02-08 08:50:04,877 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 67 [2025-02-08 08:50:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,877 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2025-02-08 08:50:04,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2025-02-08 08:50:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 08:50:04,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,878 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:50:04,878 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:04,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1311118256, now seen corresponding path program 2 times [2025-02-08 08:50:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:04,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148783440] [2025-02-08 08:50:04,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:04,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-08 08:50:04,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 88 statements. [2025-02-08 08:50:04,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:04,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 08:50:04,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148783440] [2025-02-08 08:50:04,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148783440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124219453] [2025-02-08 08:50:04,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:04,911 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 08:50:04,912 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 08:50:04,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-08 08:50:04,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 88 statements. [2025-02-08 08:50:04,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:04,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:04,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 08:50:05,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 08:50:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124219453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:05,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:05,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 08:50:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87957257] [2025-02-08 08:50:05,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:50:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:05,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:50:05,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:05,139 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 08:50:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:05,184 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2025-02-08 08:50:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:50:05,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 88 [2025-02-08 08:50:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:05,186 INFO L225 Difference]: With dead ends: 220 [2025-02-08 08:50:05,186 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 08:50:05,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:50:05,187 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:05,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 08:50:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-08 08:50:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 180 states have (on average 1.0888888888888888) internal successors, (196), 182 states have internal predecessors, (196), 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 08:50:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2025-02-08 08:50:05,192 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 88 [2025-02-08 08:50:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:05,192 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2025-02-08 08:50:05,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 08:50:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2025-02-08 08:50:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-08 08:50:05,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:05,193 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:05,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:05,394 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,SelfDestructingSolverStorable23 [2025-02-08 08:50:05,394 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:05,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash 649070074, now seen corresponding path program 1 times [2025-02-08 08:50:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144181660] [2025-02-08 08:50:05,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:05,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 08:50:05,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 08:50:05,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-08 08:50:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144181660] [2025-02-08 08:50:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144181660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194419107] [2025-02-08 08:50:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:05,478 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 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 08:50:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:05,506 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2025-02-08 08:50:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 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 134 [2025-02-08 08:50:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:05,507 INFO L225 Difference]: With dead ends: 183 [2025-02-08 08:50:05,507 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 08:50:05,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:05,507 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:05,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 08:50:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-02-08 08:50:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.0833333333333333) internal successors, (195), 181 states have internal predecessors, (195), 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 08:50:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2025-02-08 08:50:05,516 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 134 [2025-02-08 08:50:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:05,516 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2025-02-08 08:50:05,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 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 08:50:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2025-02-08 08:50:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-08 08:50:05,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:05,518 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 10, 10, 9, 9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:05,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:50:05,519 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:05,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 673707187, now seen corresponding path program 2 times [2025-02-08 08:50:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:05,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227843358] [2025-02-08 08:50:05,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:05,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:05,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-02-08 08:50:05,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 142 statements. [2025-02-08 08:50:05,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:05,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-08 08:50:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227843358] [2025-02-08 08:50:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227843358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937527416] [2025-02-08 08:50:05,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:05,618 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 08:50:05,620 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 08:50:05,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-02-08 08:50:05,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 142 statements. [2025-02-08 08:50:05,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:05,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:05,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-02-08 08:50:05,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-02-08 08:50:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937527416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:06,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:06,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 7 [2025-02-08 08:50:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620806868] [2025-02-08 08:50:06,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:06,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:50:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:06,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:50:06,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:06,153 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 08:50:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:06,189 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2025-02-08 08:50:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:06,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 142 [2025-02-08 08:50:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:06,191 INFO L225 Difference]: With dead ends: 182 [2025-02-08 08:50:06,191 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:50:06,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:06,191 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:06,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:50:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:50:06,192 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 08:50:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:50:06,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2025-02-08 08:50:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:50:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 08:50:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:50:06,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:50:06,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-08 08:50:06,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-08 08:50:06,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-08 08:50:06,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-08 08:50:06,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-08 08:50:06,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-08 08:50:06,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-08 08:50:06,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-08 08:50:06,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 08:50:06,398 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,SelfDestructingSolverStorable25 [2025-02-08 08:50:06,401 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:06,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:50:06,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:50:06,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:50:06 BoogieIcfgContainer [2025-02-08 08:50:06,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:50:06,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:50:06,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:50:06,677 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:50:06,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:57" (3/4) ... [2025-02-08 08:50:06,679 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:50:06,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:50:06,688 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:50:06,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:50:06,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:50:06,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:50:06,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:50:06,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:50:06,756 INFO L158 Benchmark]: Toolchain (without parser) took 9570.08ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.9MB in the beginning and 119.3MB in the end (delta: -6.4MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,756 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:06,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.17ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.45ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:06,756 INFO L158 Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.8MB in the end (delta: 976.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:06,757 INFO L158 Benchmark]: IcfgBuilder took 289.79ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 83.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,757 INFO L158 Benchmark]: TraceAbstraction took 8974.41ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 82.6MB in the beginning and 125.2MB in the end (delta: -42.7MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,757 INFO L158 Benchmark]: Witness Printer took 78.36ms. Allocated memory is still 218.1MB. Free memory was 125.2MB in the beginning and 119.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,758 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.17ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.45ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.67ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.8MB in the end (delta: 976.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.79ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 83.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8974.41ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 82.6MB in the beginning and 125.2MB in the end (delta: -42.7MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 78.36ms. Allocated memory is still 218.1MB. Free memory was 125.2MB in the beginning and 119.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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, 52 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 26, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 894 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 894 mSDsluCounter, 2387 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1525 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2323 IncrementalHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 862 mSDtfsCounter, 2323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1221 GetRequests, 1076 SyntacticMatches, 10 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=22, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 72 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1834 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2218 ConstructedInterpolants, 0 QuantifiedInterpolants, 7501 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1420 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 3631/4058 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 16 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((2 <= CELLCOUNT) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || (((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((((((((((((((i <= 536870911) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= i)) && (2 <= MINVAL)) || ((((((2 == j) && (2 <= CELLCOUNT)) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((2 == j) && (i <= 536870911)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) || ((((((2 <= CELLCOUNT) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= MINVAL))) || ((((((j == 4) && (2 <= CELLCOUNT)) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((j == 4) && (i <= 536870911)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) || ((((((j <= 1) && (2 <= CELLCOUNT)) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((j <= 1) && (i <= 536870911)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || (((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:50:06,772 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