./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/mbpr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mbpr5.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 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:18:37,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:18:37,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:18:37,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:18:37,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:18:37,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:18:37,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:18:37,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:18:37,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:18:37,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:18:37,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:18:37,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:18:37,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:18:37,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:18:37,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:18:37,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:18:37,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:18:37,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:18:37,211 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 -> 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b [2025-02-06 13:18:37,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:18:37,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:18:37,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:18:37,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:18:37,518 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:18:37,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr5.c [2025-02-06 13:18:38,719 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f554597c/2d69805c620647369dff60751492fe8f/FLAG86324c49c [2025-02-06 13:18:38,985 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:18:38,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr5.c [2025-02-06 13:18:38,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f554597c/2d69805c620647369dff60751492fe8f/FLAG86324c49c [2025-02-06 13:18:39,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f554597c/2d69805c620647369dff60751492fe8f [2025-02-06 13:18:39,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:18:39,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:18:39,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:18:39,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:18:39,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:18:39,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed0f9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39, skipping insertion in model container [2025-02-06 13:18:39,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:18:39,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:18:39,150 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:18:39,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:18:39,195 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:18:39,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39 WrapperNode [2025-02-06 13:18:39,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:18:39,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:18:39,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:18:39,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:18:39,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,228 INFO L138 Inliner]: procedures = 15, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 397 [2025-02-06 13:18:39,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:18:39,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:18:39,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:18:39,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:18:39,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,247 INFO L175 MemorySlicer]: Split 62 memory accesses to 3 slices as follows [2, 8, 52]. 84 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 30 writes are split as follows [0, 0, 30]. [2025-02-06 13:18:39,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:18:39,262 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:18:39,262 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:18:39,262 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:18:39,263 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 13:18:39,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:18:39,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:39,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:18:39,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:18:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:18:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:18:39,357 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:18:39,359 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:18:39,936 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-02-06 13:18:39,937 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:18:39,951 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:18:39,951 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:18:39,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:39 BoogieIcfgContainer [2025-02-06 13:18:39,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:18:39,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:18:39,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:18:39,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:18:39,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:18:39" (1/3) ... [2025-02-06 13:18:39,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735f4dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:39, skipping insertion in model container [2025-02-06 13:18:39,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (2/3) ... [2025-02-06 13:18:39,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735f4dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:39, skipping insertion in model container [2025-02-06 13:18:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:39" (3/3) ... [2025-02-06 13:18:39,959 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2025-02-06 13:18:39,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:18:39,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr5.c that has 1 procedures, 481 locations, 1 initial locations, 6 loop locations, and 222 error locations. [2025-02-06 13:18:40,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:18:40,040 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;@4f38aad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:18:40,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 222 error locations. [2025-02-06 13:18:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 481 states, 258 states have (on average 1.941860465116279) internal successors, (501), 480 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:18:40,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:40,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:40,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash -591249219, now seen corresponding path program 1 times [2025-02-06 13:18:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19783156] [2025-02-06 13:18:40,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:40,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:18:40,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:18:40,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:40,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:40,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19783156] [2025-02-06 13:18:40,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19783156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:40,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:40,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:18:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570611196] [2025-02-06 13:18:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:18:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:40,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:18:40,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:18:40,223 INFO L87 Difference]: Start difference. First operand has 481 states, 258 states have (on average 1.941860465116279) internal successors, (501), 480 states have internal predecessors, (501), 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 4.0) internal successors, (8), 2 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-06 13:18:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:40,258 INFO L93 Difference]: Finished difference Result 956 states and 993 transitions. [2025-02-06 13:18:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:18:40,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-06 13:18:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:40,270 INFO L225 Difference]: With dead ends: 956 [2025-02-06 13:18:40,270 INFO L226 Difference]: Without dead ends: 475 [2025-02-06 13:18:40,273 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-06 13:18:40,274 INFO L435 NwaCegarLoop]: 493 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, 493 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-06 13:18:40,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-06 13:18:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2025-02-06 13:18:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 253 states have (on average 1.9209486166007905) internal successors, (486), 474 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 486 transitions. [2025-02-06 13:18:40,360 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 486 transitions. Word has length 8 [2025-02-06 13:18:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:40,361 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 486 transitions. [2025-02-06 13:18:40,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-06 13:18:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 486 transitions. [2025-02-06 13:18:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:18:40,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:40,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:40,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:18:40,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:40,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -591219428, now seen corresponding path program 1 times [2025-02-06 13:18:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:40,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547090959] [2025-02-06 13:18:40,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:18:40,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:18:40,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:40,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547090959] [2025-02-06 13:18:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547090959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749010885] [2025-02-06 13:18:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:40,528 INFO L87 Difference]: Start difference. First operand 475 states and 486 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-06 13:18:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:40,580 INFO L93 Difference]: Finished difference Result 475 states and 486 transitions. [2025-02-06 13:18:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:40,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-06 13:18:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:40,582 INFO L225 Difference]: With dead ends: 475 [2025-02-06 13:18:40,582 INFO L226 Difference]: Without dead ends: 470 [2025-02-06 13:18:40,583 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-06 13:18:40,583 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 948 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:40,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 454 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-06 13:18:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-02-06 13:18:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 253 states have (on average 1.901185770750988) internal successors, (481), 469 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 481 transitions. [2025-02-06 13:18:40,594 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 481 transitions. Word has length 8 [2025-02-06 13:18:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:40,594 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 481 transitions. [2025-02-06 13:18:40,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-06 13:18:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 481 transitions. [2025-02-06 13:18:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:18:40,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:40,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:40,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:18:40,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:40,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1147932628, now seen corresponding path program 1 times [2025-02-06 13:18:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360381223] [2025-02-06 13:18:40,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:40,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:18:40,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:18:40,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:40,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360381223] [2025-02-06 13:18:40,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360381223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:40,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:40,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:18:40,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921304876] [2025-02-06 13:18:40,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:40,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:40,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:40,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:40,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:40,782 INFO L87 Difference]: Start difference. First operand 470 states and 481 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:40,851 INFO L93 Difference]: Finished difference Result 470 states and 481 transitions. [2025-02-06 13:18:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 13:18:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:40,853 INFO L225 Difference]: With dead ends: 470 [2025-02-06 13:18:40,853 INFO L226 Difference]: Without dead ends: 465 [2025-02-06 13:18:40,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:18:40,854 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1409 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:40,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 453 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-02-06 13:18:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-02-06 13:18:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 253 states have (on average 1.8814229249011858) internal successors, (476), 464 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 476 transitions. [2025-02-06 13:18:40,876 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 476 transitions. Word has length 9 [2025-02-06 13:18:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:40,876 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 476 transitions. [2025-02-06 13:18:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 476 transitions. [2025-02-06 13:18:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:18:40,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:40,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:40,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:18:40,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:40,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1530859248, now seen corresponding path program 1 times [2025-02-06 13:18:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:40,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634158755] [2025-02-06 13:18:40,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:18:40,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:18:40,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:40,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634158755] [2025-02-06 13:18:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634158755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:40,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:40,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:18:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308263254] [2025-02-06 13:18:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:40,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:18:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:18:40,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:40,937 INFO L87 Difference]: Start difference. First operand 465 states and 476 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-06 13:18:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:41,566 INFO L93 Difference]: Finished difference Result 890 states and 911 transitions. [2025-02-06 13:18:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:18:41,567 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-06 13:18:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:41,569 INFO L225 Difference]: With dead ends: 890 [2025-02-06 13:18:41,569 INFO L226 Difference]: Without dead ends: 690 [2025-02-06 13:18:41,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:41,570 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 220 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:41,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 315 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 13:18:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-06 13:18:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-02-06 13:18:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 478 states have (on average 1.4874476987447698) internal successors, (711), 689 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 711 transitions. [2025-02-06 13:18:41,581 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 711 transitions. Word has length 12 [2025-02-06 13:18:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:41,582 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 711 transitions. [2025-02-06 13:18:41,582 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-06 13:18:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 711 transitions. [2025-02-06 13:18:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 13:18:41,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:41,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:41,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:18:41,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1427199057, now seen corresponding path program 1 times [2025-02-06 13:18:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:41,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906988420] [2025-02-06 13:18:41,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:41,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 13:18:41,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:18:41,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:41,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906988420] [2025-02-06 13:18:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906988420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779714108] [2025-02-06 13:18:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:41,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:41,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:41,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:41,694 INFO L87 Difference]: Start difference. First operand 690 states and 711 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:42,032 INFO L93 Difference]: Finished difference Result 699 states and 721 transitions. [2025-02-06 13:18:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-06 13:18:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:42,035 INFO L225 Difference]: With dead ends: 699 [2025-02-06 13:18:42,035 INFO L226 Difference]: Without dead ends: 697 [2025-02-06 13:18:42,035 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-06 13:18:42,040 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:42,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:18:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-06 13:18:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2025-02-06 13:18:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 485 states have (on average 1.4824742268041238) internal successors, (719), 696 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 719 transitions. [2025-02-06 13:18:42,058 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 719 transitions. Word has length 37 [2025-02-06 13:18:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:42,058 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 719 transitions. [2025-02-06 13:18:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 719 transitions. [2025-02-06 13:18:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 13:18:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:42,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:42,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:18:42,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1318586512, now seen corresponding path program 1 times [2025-02-06 13:18:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707177623] [2025-02-06 13:18:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:42,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 13:18:42,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 13:18:42,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:42,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:42,332 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-06 13:18:42,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707177623] [2025-02-06 13:18:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707177623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:42,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:42,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:18:42,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762064577] [2025-02-06 13:18:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:42,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:42,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:42,333 INFO L87 Difference]: Start difference. First operand 697 states and 719 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:43,282 INFO L93 Difference]: Finished difference Result 1254 states and 1294 transitions. [2025-02-06 13:18:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-06 13:18:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:43,284 INFO L225 Difference]: With dead ends: 1254 [2025-02-06 13:18:43,284 INFO L226 Difference]: Without dead ends: 697 [2025-02-06 13:18:43,284 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-06 13:18:43,285 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1390 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:43,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 291 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 13:18:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-06 13:18:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2025-02-06 13:18:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 485 states have (on average 1.4721649484536083) internal successors, (714), 696 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 714 transitions. [2025-02-06 13:18:43,298 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 714 transitions. Word has length 44 [2025-02-06 13:18:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:43,298 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 714 transitions. [2025-02-06 13:18:43,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 714 transitions. [2025-02-06 13:18:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 13:18:43,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:43,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:18:43,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:43,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2080571668, now seen corresponding path program 1 times [2025-02-06 13:18:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-02-06 13:18:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:43,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 13:18:43,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:18:43,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:43,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-02-06 13:18:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105851264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:43,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:43,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525108516] [2025-02-06 13:18:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:43,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:43,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:43,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:43,357 INFO L87 Difference]: Start difference. First operand 697 states and 714 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:43,924 INFO L93 Difference]: Finished difference Result 701 states and 718 transitions. [2025-02-06 13:18:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2025-02-06 13:18:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:43,928 INFO L225 Difference]: With dead ends: 701 [2025-02-06 13:18:43,928 INFO L226 Difference]: Without dead ends: 699 [2025-02-06 13:18:43,929 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-06 13:18:43,929 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 186 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:43,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 583 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:18:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-06 13:18:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-02-06 13:18:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 487 states have (on average 1.4702258726899384) internal successors, (716), 698 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 716 transitions. [2025-02-06 13:18:43,951 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 716 transitions. Word has length 48 [2025-02-06 13:18:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:43,951 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 716 transitions. [2025-02-06 13:18:43,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 716 transitions. [2025-02-06 13:18:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 13:18:43,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:43,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:43,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:18:43,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:43,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1399504522, now seen corresponding path program 1 times [2025-02-06 13:18:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:43,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140853716] [2025-02-06 13:18:43,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:43,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 13:18:44,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 13:18:44,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:44,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140853716] [2025-02-06 13:18:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140853716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:44,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349204764] [2025-02-06 13:18:44,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:44,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:44,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:44,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:44,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:18:44,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 13:18:44,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 13:18:44,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:44,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:44,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:44,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:44,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349204764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:18:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234272906] [2025-02-06 13:18:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:44,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:44,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:44,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:44,305 INFO L87 Difference]: Start difference. First operand 699 states and 716 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 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-06 13:18:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:44,934 INFO L93 Difference]: Finished difference Result 699 states and 716 transitions. [2025-02-06 13:18:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 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 55 [2025-02-06 13:18:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:44,937 INFO L225 Difference]: With dead ends: 699 [2025-02-06 13:18:44,940 INFO L226 Difference]: Without dead ends: 678 [2025-02-06 13:18:44,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:44,943 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 225 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:44,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 548 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 13:18:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-06 13:18:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2025-02-06 13:18:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 487 states have (on average 1.4271047227926077) internal successors, (695), 677 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 695 transitions. [2025-02-06 13:18:44,955 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 695 transitions. Word has length 55 [2025-02-06 13:18:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 695 transitions. [2025-02-06 13:18:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 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-06 13:18:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 695 transitions. [2025-02-06 13:18:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 13:18:44,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:44,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:44,969 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-06 13:18:45,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:45,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -434966782, now seen corresponding path program 1 times [2025-02-06 13:18:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357423941] [2025-02-06 13:18:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:45,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 13:18:45,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:18:45,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:45,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357423941] [2025-02-06 13:18:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357423941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361233239] [2025-02-06 13:18:45,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:45,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:45,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:45,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:18:45,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 13:18:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:18:45,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:45,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:45,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:45,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:45,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:45,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361233239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:45,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:45,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:18:45,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304015604] [2025-02-06 13:18:45,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:45,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:18:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:45,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:18:45,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:45,472 INFO L87 Difference]: Start difference. First operand 678 states and 695 transitions. Second operand has 10 states, 9 states have (on average 16.77777777777778) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:46,203 INFO L93 Difference]: Finished difference Result 737 states and 778 transitions. [2025-02-06 13:18:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:18:46,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.77777777777778) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-06 13:18:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:46,206 INFO L225 Difference]: With dead ends: 737 [2025-02-06 13:18:46,206 INFO L226 Difference]: Without dead ends: 644 [2025-02-06 13:18:46,207 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-06 13:18:46,207 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 793 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:46,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 312 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 13:18:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-06 13:18:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 640. [2025-02-06 13:18:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 539 states have (on average 1.2263450834879406) internal successors, (661), 639 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 661 transitions. [2025-02-06 13:18:46,223 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 661 transitions. Word has length 56 [2025-02-06 13:18:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:46,223 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 661 transitions. [2025-02-06 13:18:46,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.77777777777778) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 661 transitions. [2025-02-06 13:18:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 13:18:46,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:46,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:46,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:46,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:46,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 179681020, now seen corresponding path program 1 times [2025-02-06 13:18:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673565221] [2025-02-06 13:18:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:46,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 13:18:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 13:18:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:46,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:18:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673565221] [2025-02-06 13:18:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673565221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540740304] [2025-02-06 13:18:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:46,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:46,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:46,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:46,522 INFO L87 Difference]: Start difference. First operand 640 states and 661 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:46,930 INFO L93 Difference]: Finished difference Result 648 states and 669 transitions. [2025-02-06 13:18:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:46,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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 96 [2025-02-06 13:18:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:46,936 INFO L225 Difference]: With dead ends: 648 [2025-02-06 13:18:46,936 INFO L226 Difference]: Without dead ends: 646 [2025-02-06 13:18:46,936 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-06 13:18:46,936 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 186 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:46,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 360 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-06 13:18:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 643. [2025-02-06 13:18:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 542 states have (on average 1.2250922509225093) internal successors, (664), 642 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 664 transitions. [2025-02-06 13:18:46,945 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 664 transitions. Word has length 96 [2025-02-06 13:18:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:46,946 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 664 transitions. [2025-02-06 13:18:46,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 664 transitions. [2025-02-06 13:18:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 13:18:46,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:46,946 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:18:46,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:46,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1271095641, now seen corresponding path program 1 times [2025-02-06 13:18:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705511615] [2025-02-06 13:18:46,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:46,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:46,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 13:18:46,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 13:18:46,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:46,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:18:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705511615] [2025-02-06 13:18:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705511615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770590680] [2025-02-06 13:18:47,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:47,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:47,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:47,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:47,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:18:47,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 13:18:47,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 13:18:47,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:47,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:47,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:47,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:18:47,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770590680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:47,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:18:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051405972] [2025-02-06 13:18:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:47,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:47,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:47,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:47,182 INFO L87 Difference]: Start difference. First operand 643 states and 664 transitions. Second operand has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:47,660 INFO L93 Difference]: Finished difference Result 646 states and 667 transitions. [2025-02-06 13:18:47,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 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 103 [2025-02-06 13:18:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:47,662 INFO L225 Difference]: With dead ends: 646 [2025-02-06 13:18:47,662 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 13:18:47,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:47,663 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 225 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:47,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 340 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:18:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 13:18:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 622. [2025-02-06 13:18:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 542 states have (on average 1.1863468634686347) internal successors, (643), 621 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 643 transitions. [2025-02-06 13:18:47,670 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 643 transitions. Word has length 103 [2025-02-06 13:18:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:47,671 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 643 transitions. [2025-02-06 13:18:47,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 643 transitions. [2025-02-06 13:18:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 13:18:47,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:47,672 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:47,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:18:47,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:47,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:47,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash -749258862, now seen corresponding path program 1 times [2025-02-06 13:18:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:47,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046141677] [2025-02-06 13:18:47,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:47,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 13:18:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 13:18:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:18:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046141677] [2025-02-06 13:18:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046141677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781583136] [2025-02-06 13:18:47,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:47,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:47,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:18:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 13:18:48,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 13:18:48,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:48,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:48,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:48,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:18:48,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:18:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781583136] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:48,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:18:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423460751] [2025-02-06 13:18:48,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:18:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:48,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:18:48,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:48,174 INFO L87 Difference]: Start difference. First operand 622 states and 643 transitions. Second operand has 10 states, 9 states have (on average 21.77777777777778) internal successors, (196), 10 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-06 13:18:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:48,957 INFO L93 Difference]: Finished difference Result 684 states and 711 transitions. [2025-02-06 13:18:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:18:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 21.77777777777778) internal successors, (196), 10 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) Word has length 104 [2025-02-06 13:18:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:48,959 INFO L225 Difference]: With dead ends: 684 [2025-02-06 13:18:48,959 INFO L226 Difference]: Without dead ends: 681 [2025-02-06 13:18:48,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 202 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-06 13:18:48,960 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 413 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:48,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 422 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 13:18:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-02-06 13:18:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 678. [2025-02-06 13:18:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 598 states have (on average 1.1755852842809364) internal successors, (703), 677 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 703 transitions. [2025-02-06 13:18:48,968 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 703 transitions. Word has length 104 [2025-02-06 13:18:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:48,968 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 703 transitions. [2025-02-06 13:18:48,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 21.77777777777778) internal successors, (196), 10 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-06 13:18:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 703 transitions. [2025-02-06 13:18:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 13:18:48,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:48,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:48,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:18:49,173 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,SelfDestructingSolverStorable11 [2025-02-06 13:18:49,173 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 993496004, now seen corresponding path program 1 times [2025-02-06 13:18:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935592109] [2025-02-06 13:18:49,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:49,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 13:18:49,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 13:18:49,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:49,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-06 13:18:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935592109] [2025-02-06 13:18:49,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935592109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:49,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:49,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347684931] [2025-02-06 13:18:49,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:49,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:49,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:49,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:49,244 INFO L87 Difference]: Start difference. First operand 678 states and 703 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 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-06 13:18:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:49,761 INFO L93 Difference]: Finished difference Result 678 states and 703 transitions. [2025-02-06 13:18:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:49,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 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 135 [2025-02-06 13:18:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:49,763 INFO L225 Difference]: With dead ends: 678 [2025-02-06 13:18:49,763 INFO L226 Difference]: Without dead ends: 677 [2025-02-06 13:18:49,763 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-06 13:18:49,764 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 196 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:49,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 202 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:18:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-06 13:18:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2025-02-06 13:18:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 598 states have (on average 1.173913043478261) internal successors, (702), 676 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 702 transitions. [2025-02-06 13:18:49,772 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 702 transitions. Word has length 135 [2025-02-06 13:18:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 702 transitions. [2025-02-06 13:18:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 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-06 13:18:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 702 transitions. [2025-02-06 13:18:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 13:18:49,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:49,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:18:49,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 165251906, now seen corresponding path program 2 times [2025-02-06 13:18:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937030748] [2025-02-06 13:18:49,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:49,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-02-06 13:18:49,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 142 statements. [2025-02-06 13:18:49,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:49,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-06 13:18:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937030748] [2025-02-06 13:18:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937030748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116361362] [2025-02-06 13:18:49,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:49,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:49,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:49,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:18:49,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-02-06 13:18:49,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 142 statements. [2025-02-06 13:18:49,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:49,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:49,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:49,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-06 13:18:50,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-06 13:18:50,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116361362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:50,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 8 [2025-02-06 13:18:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533010958] [2025-02-06 13:18:50,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:50,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:18:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:50,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:18:50,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:18:50,644 INFO L87 Difference]: Start difference. First operand 677 states and 702 transitions. Second operand has 9 states, 8 states have (on average 18.875) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:50,996 INFO L93 Difference]: Finished difference Result 677 states and 702 transitions. [2025-02-06 13:18:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:18:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 18.875) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-02-06 13:18:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:50,998 INFO L225 Difference]: With dead ends: 677 [2025-02-06 13:18:50,998 INFO L226 Difference]: Without dead ends: 667 [2025-02-06 13:18:50,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:18:50,999 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1451 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:50,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 73 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:18:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-06 13:18:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 559. [2025-02-06 13:18:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 490 states have (on average 1.1775510204081632) internal successors, (577), 558 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 577 transitions. [2025-02-06 13:18:51,007 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 577 transitions. Word has length 142 [2025-02-06 13:18:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:51,008 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 577 transitions. [2025-02-06 13:18:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 18.875) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 577 transitions. [2025-02-06 13:18:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 13:18:51,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:51,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:51,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:51,210 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,SelfDestructingSolverStorable13 [2025-02-06 13:18:51,210 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:51,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2005160460, now seen corresponding path program 1 times [2025-02-06 13:18:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086851] [2025-02-06 13:18:51,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:51,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 13:18:51,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 13:18:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:18:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316086851] [2025-02-06 13:18:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316086851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551553737] [2025-02-06 13:18:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:51,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:51,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:51,298 INFO L87 Difference]: Start difference. First operand 559 states and 577 transitions. Second operand has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:51,692 INFO L93 Difference]: Finished difference Result 607 states and 626 transitions. [2025-02-06 13:18:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 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 144 [2025-02-06 13:18:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:51,694 INFO L225 Difference]: With dead ends: 607 [2025-02-06 13:18:51,694 INFO L226 Difference]: Without dead ends: 605 [2025-02-06 13:18:51,695 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-06 13:18:51,695 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 186 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:51,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 294 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-06 13:18:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 562. [2025-02-06 13:18:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 493 states have (on average 1.1764705882352942) internal successors, (580), 561 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 580 transitions. [2025-02-06 13:18:51,704 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 580 transitions. Word has length 144 [2025-02-06 13:18:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:51,704 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 580 transitions. [2025-02-06 13:18:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 580 transitions. [2025-02-06 13:18:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 13:18:51,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:51,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:51,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:18:51,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1861794008, now seen corresponding path program 1 times [2025-02-06 13:18:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627679633] [2025-02-06 13:18:51,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 13:18:51,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 13:18:51,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:51,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:18:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627679633] [2025-02-06 13:18:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627679633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738355963] [2025-02-06 13:18:51,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:51,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:18:51,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 13:18:51,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 13:18:51,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:51,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:51,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:51,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:18:51,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:51,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738355963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:51,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:51,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:18:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791435511] [2025-02-06 13:18:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:51,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:51,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:51,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:51,945 INFO L87 Difference]: Start difference. First operand 562 states and 580 transitions. Second operand has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,373 INFO L93 Difference]: Finished difference Result 605 states and 624 transitions. [2025-02-06 13:18:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:52,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 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 151 [2025-02-06 13:18:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,375 INFO L225 Difference]: With dead ends: 605 [2025-02-06 13:18:52,375 INFO L226 Difference]: Without dead ends: 584 [2025-02-06 13:18:52,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:52,376 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 225 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:52,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 278 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-02-06 13:18:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 541. [2025-02-06 13:18:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 493 states have (on average 1.1338742393509127) internal successors, (559), 540 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 559 transitions. [2025-02-06 13:18:52,383 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 559 transitions. Word has length 151 [2025-02-06 13:18:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 559 transitions. [2025-02-06 13:18:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 559 transitions. [2025-02-06 13:18:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-06 13:18:52,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,391 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-06 13:18:52,585 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,SelfDestructingSolverStorable15 [2025-02-06 13:18:52,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -153738251, now seen corresponding path program 1 times [2025-02-06 13:18:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60485319] [2025-02-06 13:18:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 13:18:52,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 13:18:52,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 13:18:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60485319] [2025-02-06 13:18:52,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60485319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584478716] [2025-02-06 13:18:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:52,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:52,651 INFO L87 Difference]: Start difference. First operand 541 states and 559 transitions. Second operand has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,943 INFO L93 Difference]: Finished difference Result 546 states and 565 transitions. [2025-02-06 13:18:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 4 states have internal predecessors, (131), 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 183 [2025-02-06 13:18:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,944 INFO L225 Difference]: With dead ends: 546 [2025-02-06 13:18:52,944 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 13:18:52,944 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-06 13:18:52,945 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 196 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:52,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 172 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:18:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 13:18:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 450. [2025-02-06 13:18:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 403 states have (on average 1.1538461538461537) internal successors, (465), 449 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 465 transitions. [2025-02-06 13:18:52,950 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 465 transitions. Word has length 183 [2025-02-06 13:18:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 465 transitions. [2025-02-06 13:18:52,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 465 transitions. [2025-02-06 13:18:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 13:18:52,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:18:52,952 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1158324222, now seen corresponding path program 1 times [2025-02-06 13:18:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349394717] [2025-02-06 13:18:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 13:18:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 13:18:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:18:53,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349394717] [2025-02-06 13:18:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349394717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:53,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849164460] [2025-02-06 13:18:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:53,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:53,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:53,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:53,179 INFO L87 Difference]: Start difference. First operand 450 states and 465 transitions. Second operand has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:53,549 INFO L93 Difference]: Finished difference Result 460 states and 477 transitions. [2025-02-06 13:18:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 4 states have internal predecessors, (176), 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 188 [2025-02-06 13:18:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:53,550 INFO L225 Difference]: With dead ends: 460 [2025-02-06 13:18:53,550 INFO L226 Difference]: Without dead ends: 459 [2025-02-06 13:18:53,551 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-06 13:18:53,551 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 196 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:53,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 169 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-06 13:18:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 406. [2025-02-06 13:18:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 360 states have (on average 1.1666666666666667) internal successors, (420), 405 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 420 transitions. [2025-02-06 13:18:53,556 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 420 transitions. Word has length 188 [2025-02-06 13:18:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:53,556 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 420 transitions. [2025-02-06 13:18:53,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 420 transitions. [2025-02-06 13:18:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 13:18:53,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:53,558 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:53,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:18:53,558 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:53,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1878446108, now seen corresponding path program 1 times [2025-02-06 13:18:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466376369] [2025-02-06 13:18:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:53,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 13:18:53,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 13:18:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:18:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466376369] [2025-02-06 13:18:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466376369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:53,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:53,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107633934] [2025-02-06 13:18:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:53,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:53,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:53,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:53,669 INFO L87 Difference]: Start difference. First operand 406 states and 420 transitions. Second operand has 4 states, 3 states have (on average 61.0) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:54,012 INFO L93 Difference]: Finished difference Result 535 states and 552 transitions. [2025-02-06 13:18:54,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:54,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.0) internal successors, (183), 4 states have internal predecessors, (183), 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 192 [2025-02-06 13:18:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:54,017 INFO L225 Difference]: With dead ends: 535 [2025-02-06 13:18:54,017 INFO L226 Difference]: Without dead ends: 533 [2025-02-06 13:18:54,017 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-06 13:18:54,017 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 186 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:54,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 245 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:18:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-06 13:18:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 409. [2025-02-06 13:18:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 363 states have (on average 1.165289256198347) internal successors, (423), 408 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 423 transitions. [2025-02-06 13:18:54,032 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 423 transitions. Word has length 192 [2025-02-06 13:18:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:54,032 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 423 transitions. [2025-02-06 13:18:54,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.0) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 423 transitions. [2025-02-06 13:18:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-06 13:18:54,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:54,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:54,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:18:54,033 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:54,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2071695369, now seen corresponding path program 1 times [2025-02-06 13:18:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:54,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069234118] [2025-02-06 13:18:54,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:54,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 13:18:54,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 13:18:54,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:54,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:18:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:54,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069234118] [2025-02-06 13:18:54,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069234118] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:54,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668202733] [2025-02-06 13:18:54,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:54,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:54,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:18:54,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:18:54,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 13:18:54,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 13:18:54,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:54,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:54,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:54,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:18:54,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:54,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668202733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:54,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:54,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:18:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212090016] [2025-02-06 13:18:54,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:54,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:54,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:54,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:54,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:54,487 INFO L87 Difference]: Start difference. First operand 409 states and 423 transitions. Second operand has 5 states, 4 states have (on average 47.5) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:54,901 INFO L93 Difference]: Finished difference Result 533 states and 550 transitions. [2025-02-06 13:18:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 47.5) internal successors, (190), 5 states have internal predecessors, (190), 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 199 [2025-02-06 13:18:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:54,903 INFO L225 Difference]: With dead ends: 533 [2025-02-06 13:18:54,903 INFO L226 Difference]: Without dead ends: 512 [2025-02-06 13:18:54,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:54,904 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 225 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:54,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 244 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-06 13:18:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 388. [2025-02-06 13:18:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 363 states have (on average 1.1074380165289257) internal successors, (402), 387 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 402 transitions. [2025-02-06 13:18:54,913 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 402 transitions. Word has length 199 [2025-02-06 13:18:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:54,913 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 402 transitions. [2025-02-06 13:18:54,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 47.5) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 402 transitions. [2025-02-06 13:18:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 13:18:54,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:54,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:54,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:55,116 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-06 13:18:55,116 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:55,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash 983337166, now seen corresponding path program 1 times [2025-02-06 13:18:55,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:55,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742208881] [2025-02-06 13:18:55,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:55,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 13:18:55,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 13:18:55,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:55,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 13:18:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742208881] [2025-02-06 13:18:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742208881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:55,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:55,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296432075] [2025-02-06 13:18:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:55,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:55,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:55,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:55,222 INFO L87 Difference]: Start difference. First operand 388 states and 402 transitions. Second operand has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:55,519 INFO L93 Difference]: Finished difference Result 403 states and 420 transitions. [2025-02-06 13:18:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 4 states have internal predecessors, (221), 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 236 [2025-02-06 13:18:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:55,521 INFO L225 Difference]: With dead ends: 403 [2025-02-06 13:18:55,521 INFO L226 Difference]: Without dead ends: 402 [2025-02-06 13:18:55,521 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-06 13:18:55,522 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 196 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 159 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:18:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-06 13:18:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 344. [2025-02-06 13:18:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 320 states have (on average 1.115625) internal successors, (357), 343 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 357 transitions. [2025-02-06 13:18:55,526 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 357 transitions. Word has length 236 [2025-02-06 13:18:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:55,526 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 357 transitions. [2025-02-06 13:18:55,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 357 transitions. [2025-02-06 13:18:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-06 13:18:55,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:55,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:55,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 13:18:55,527 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 94056748, now seen corresponding path program 1 times [2025-02-06 13:18:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743656281] [2025-02-06 13:18:55,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:55,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 13:18:55,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 13:18:55,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:55,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:18:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743656281] [2025-02-06 13:18:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743656281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989236334] [2025-02-06 13:18:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:55,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:18:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:55,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:18:55,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:55,638 INFO L87 Difference]: Start difference. First operand 344 states and 357 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:55,653 INFO L93 Difference]: Finished difference Result 455 states and 472 transitions. [2025-02-06 13:18:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:18:55,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 240 [2025-02-06 13:18:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:55,654 INFO L225 Difference]: With dead ends: 455 [2025-02-06 13:18:55,654 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 13:18:55,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:55,655 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 91 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 272 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-06 13:18:55,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 272 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 13:18:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-02-06 13:18:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 312 states have (on average 1.1057692307692308) internal successors, (345), 333 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 345 transitions. [2025-02-06 13:18:55,659 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 345 transitions. Word has length 240 [2025-02-06 13:18:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 345 transitions. [2025-02-06 13:18:55,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 345 transitions. [2025-02-06 13:18:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-06 13:18:55,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:55,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 13:18:55,661 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:55,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash -974500917, now seen corresponding path program 1 times [2025-02-06 13:18:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302294579] [2025-02-06 13:18:55,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:55,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 13:18:55,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 13:18:55,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:55,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:18:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302294579] [2025-02-06 13:18:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302294579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:55,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:55,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335680475] [2025-02-06 13:18:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:55,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:55,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:55,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:55,757 INFO L87 Difference]: Start difference. First operand 334 states and 345 transitions. Second operand has 4 states, 3 states have (on average 76.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,175 INFO L93 Difference]: Finished difference Result 503 states and 518 transitions. [2025-02-06 13:18:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:56,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 76.0) internal successors, (228), 4 states have internal predecessors, (228), 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 240 [2025-02-06 13:18:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,176 INFO L225 Difference]: With dead ends: 503 [2025-02-06 13:18:56,177 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 13:18:56,177 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-06 13:18:56,177 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 181 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:56,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 192 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 13:18:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 337. [2025-02-06 13:18:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 315 states have (on average 1.1047619047619048) internal successors, (348), 336 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 348 transitions. [2025-02-06 13:18:56,182 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 348 transitions. Word has length 240 [2025-02-06 13:18:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,182 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 348 transitions. [2025-02-06 13:18:56,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 76.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 348 transitions. [2025-02-06 13:18:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-06 13:18:56,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 13:18:56,184 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:56,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash 145860834, now seen corresponding path program 1 times [2025-02-06 13:18:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902131577] [2025-02-06 13:18:56,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-06 13:18:56,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-06 13:18:56,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:18:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902131577] [2025-02-06 13:18:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902131577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818589903] [2025-02-06 13:18:56,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:56,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:56,292 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-06 13:18:56,293 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-06 13:18:56,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-06 13:18:56,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-06 13:18:56,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:56,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:18:56,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818589903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:18:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141688529] [2025-02-06 13:18:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:56,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:56,446 INFO L87 Difference]: Start difference. First operand 337 states and 348 transitions. Second operand has 5 states, 4 states have (on average 58.75) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,833 INFO L93 Difference]: Finished difference Result 501 states and 516 transitions. [2025-02-06 13:18:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 58.75) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-02-06 13:18:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,835 INFO L225 Difference]: With dead ends: 501 [2025-02-06 13:18:56,835 INFO L226 Difference]: Without dead ends: 482 [2025-02-06 13:18:56,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:56,836 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 215 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:56,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 178 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-06 13:18:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 318. [2025-02-06 13:18:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 315 states have (on average 1.0444444444444445) internal successors, (329), 317 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 329 transitions. [2025-02-06 13:18:56,840 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 329 transitions. Word has length 247 [2025-02-06 13:18:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,840 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 329 transitions. [2025-02-06 13:18:56,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 58.75) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 329 transitions. [2025-02-06 13:18:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-06 13:18:56,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:57,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:57,045 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:57,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash -891571079, now seen corresponding path program 1 times [2025-02-06 13:18:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309102065] [2025-02-06 13:18:57,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-06 13:18:57,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-06 13:18:57,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 13:18:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309102065] [2025-02-06 13:18:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309102065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937834100] [2025-02-06 13:18:57,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:57,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:57,188 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-06 13:18:57,192 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-06 13:18:57,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-06 13:18:57,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-06 13:18:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:57,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 13:18:57,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937834100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:18:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236298562] [2025-02-06 13:18:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:18:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:18:57,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:18:57,353 INFO L87 Difference]: Start difference. First operand 318 states and 329 transitions. Second operand has 6 states, 5 states have (on average 48.8) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,724 INFO L93 Difference]: Finished difference Result 482 states and 497 transitions. [2025-02-06 13:18:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 48.8) internal successors, (244), 6 states have internal predecessors, (244), 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 259 [2025-02-06 13:18:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,726 INFO L225 Difference]: With dead ends: 482 [2025-02-06 13:18:57,726 INFO L226 Difference]: Without dead ends: 481 [2025-02-06 13:18:57,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 257 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-06 13:18:57,727 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 223 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 182 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:18:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-06 13:18:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 317. [2025-02-06 13:18:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 315 states have (on average 1.0412698412698413) internal successors, (328), 316 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 328 transitions. [2025-02-06 13:18:57,731 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 328 transitions. Word has length 259 [2025-02-06 13:18:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,731 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 328 transitions. [2025-02-06 13:18:57,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 48.8) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 328 transitions. [2025-02-06 13:18:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-06 13:18:57,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:57,743 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-06 13:18:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:57,937 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1868899699, now seen corresponding path program 1 times [2025-02-06 13:18:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951093812] [2025-02-06 13:18:57,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 13:18:57,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 13:18:57,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 13:18:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951093812] [2025-02-06 13:18:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951093812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667441131] [2025-02-06 13:18:58,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:58,085 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-06 13:18:58,090 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-06 13:18:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 13:18:58,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 13:18:58,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:58,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 13:18:58,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 13:18:58,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667441131] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:58,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:18:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962187263] [2025-02-06 13:18:58,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:18:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:18:58,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:18:58,295 INFO L87 Difference]: Start difference. First operand 317 states and 328 transitions. Second operand has 12 states, 11 states have (on average 24.363636363636363) internal successors, (268), 12 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,770 INFO L93 Difference]: Finished difference Result 503 states and 523 transitions. [2025-02-06 13:18:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:18:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.363636363636363) internal successors, (268), 12 states have internal predecessors, (268), 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 260 [2025-02-06 13:18:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,772 INFO L225 Difference]: With dead ends: 503 [2025-02-06 13:18:58,772 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 13:18:58,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 513 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-06 13:18:58,773 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 793 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:58,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 241 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:18:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 13:18:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 338. [2025-02-06 13:18:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 336 states have (on average 1.0476190476190477) internal successors, (352), 337 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 352 transitions. [2025-02-06 13:18:58,779 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 352 transitions. Word has length 260 [2025-02-06 13:18:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,779 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 352 transitions. [2025-02-06 13:18:58,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.363636363636363) internal successors, (268), 12 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 352 transitions. [2025-02-06 13:18:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-02-06 13:18:58,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,781 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:58,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:18:58,982 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,SelfDestructingSolverStorable25 [2025-02-06 13:18:58,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:18:58,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash 586532510, now seen corresponding path program 2 times [2025-02-06 13:18:58,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60635304] [2025-02-06 13:18:58,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 281 statements into 2 equivalence classes. [2025-02-06 13:18:59,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 281 statements. [2025-02-06 13:18:59,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:59,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 13:18:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60635304] [2025-02-06 13:18:59,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60635304] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210642341] [2025-02-06 13:18:59,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:59,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:59,034 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-06 13:18:59,037 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-06 13:18:59,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 281 statements into 2 equivalence classes. [2025-02-06 13:18:59,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 281 statements. [2025-02-06 13:18:59,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:59,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:59,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 13:18:59,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 13:18:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210642341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:59,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:59,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-06 13:18:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349801381] [2025-02-06 13:18:59,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:59,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:59,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:59,589 INFO L87 Difference]: Start difference. First operand 338 states and 352 transitions. Second operand has 5 states, 4 states have (on average 61.25) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:59,822 INFO L93 Difference]: Finished difference Result 338 states and 352 transitions. [2025-02-06 13:18:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:59,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 61.25) internal successors, (245), 5 states have internal predecessors, (245), 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 281 [2025-02-06 13:18:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:59,824 INFO L225 Difference]: With dead ends: 338 [2025-02-06 13:18:59,824 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 13:18:59,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 559 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-06 13:18:59,824 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 243 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:59,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 86 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:18:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 13:18:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-02-06 13:18:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.03) internal successors, (309), 300 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 309 transitions. [2025-02-06 13:18:59,829 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 309 transitions. Word has length 281 [2025-02-06 13:18:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:59,829 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 309 transitions. [2025-02-06 13:18:59,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 61.25) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 309 transitions. [2025-02-06 13:18:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-02-06 13:18:59,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:59,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:59,838 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-06 13:19:00,034 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,SelfDestructingSolverStorable26 [2025-02-06 13:19:00,047 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-02-06 13:19:00,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2125138434, now seen corresponding path program 1 times [2025-02-06 13:19:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004297457] [2025-02-06 13:19:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:00,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-06 13:19:00,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-06 13:19:00,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:00,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 13:19:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004297457] [2025-02-06 13:19:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004297457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982270877] [2025-02-06 13:19:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:00,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:00,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:00,208 INFO L87 Difference]: Start difference. First operand 301 states and 309 transitions. Second operand has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:00,482 INFO L93 Difference]: Finished difference Result 321 states and 333 transitions. [2025-02-06 13:19:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 4 states have internal predecessors, (266), 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 284 [2025-02-06 13:19:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:00,483 INFO L225 Difference]: With dead ends: 321 [2025-02-06 13:19:00,483 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:19:00,483 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-06 13:19:00,484 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 186 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:00,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 122 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:19:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:19:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:19:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:19:00,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2025-02-06 13:19:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:00,485 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:19:00,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:19:00,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:19:00,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (221 of 222 remaining) [2025-02-06 13:19:00,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (220 of 222 remaining) [2025-02-06 13:19:00,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (219 of 222 remaining) [2025-02-06 13:19:00,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (218 of 222 remaining) [2025-02-06 13:19:00,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (217 of 222 remaining) [2025-02-06 13:19:00,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (216 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (215 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (214 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (213 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (212 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (211 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (210 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (209 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (208 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (207 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (206 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (205 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (204 of 222 remaining) [2025-02-06 13:19:00,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (203 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (202 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (201 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (200 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (199 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (198 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (197 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (196 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (195 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (194 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (193 of 222 remaining) [2025-02-06 13:19:00,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (192 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (191 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (190 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (189 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (188 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (187 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (186 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (185 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (184 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (183 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (182 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (181 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (180 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 222 remaining) [2025-02-06 13:19:00,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 222 remaining) [2025-02-06 13:19:00,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 222 remaining) [2025-02-06 13:19:00,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 222 remaining) [2025-02-06 13:19:00,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 222 remaining) [2025-02-06 13:19:00,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 222 remaining) [2025-02-06 13:19:00,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 222 remaining) [2025-02-06 13:19:00,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 222 remaining) [2025-02-06 13:19:00,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 222 remaining) [2025-02-06 13:19:00,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr177ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr180ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr181ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr184ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr185ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr186ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr189ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 222 remaining) [2025-02-06 13:19:00,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr190ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr192ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr193ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr196ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr197ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr198ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr201ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr202ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr204ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr205ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr208ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr209ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr210ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr213ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr216ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr217ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 222 remaining) [2025-02-06 13:19:00,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 222 remaining) [2025-02-06 13:19:00,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 13:19:00,504 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:00,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:19:00,704 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:19:00,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:19:00 BoogieIcfgContainer [2025-02-06 13:19:00,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:19:00,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:19:00,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:19:00,732 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:19:00,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:39" (3/4) ... [2025-02-06 13:19:00,734 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:19:00,748 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 13:19:00,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 13:19:00,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:19:00,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:19:00,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:19:00,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:19:00,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:19:00,868 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:19:00,869 INFO L158 Benchmark]: Toolchain (without parser) took 21857.81ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 132.1MB in the beginning and 201.0MB in the end (delta: -69.0MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,869 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:00,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.84ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 118.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.72ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 114.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:00,869 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 112.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:00,870 INFO L158 Benchmark]: IcfgBuilder took 689.33ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 65.9MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,870 INFO L158 Benchmark]: TraceAbstraction took 20778.47ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 65.5MB in the beginning and 79.5MB in the end (delta: -14.0MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,870 INFO L158 Benchmark]: Witness Printer took 136.47ms. Allocated memory is still 243.3MB. Free memory was 79.5MB in the beginning and 201.0MB in the end (delta: -121.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,871 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.84ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 118.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.72ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 114.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 112.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 689.33ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 65.9MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20778.47ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 65.5MB in the beginning and 79.5MB in the end (delta: -14.0MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 136.47ms. Allocated memory is still 243.3MB. Free memory was 79.5MB in the beginning and 201.0MB in the end (delta: -121.6MB). 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: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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: 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: 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: 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: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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, 481 locations, 222 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10986 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10986 mSDsluCounter, 8667 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3976 mSDsCounter, 660 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19189 IncrementalHoareTripleChecker+Invalid, 19849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 660 mSolverCounterUnsat, 4691 mSDtfsCounter, 19189 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2793 GetRequests, 2686 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=7, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 1317 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 5818 NumberOfCodeBlocks, 5074 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 6617 ConstructedInterpolants, 0 QuantifiedInterpolants, 14669 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2996 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 1338/1536 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 222 specifications checked. All of them hold - InvariantResult [Line: 94]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 110]: Location Invariant Derived location invariant: (((((((i == 0) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((1 <= i) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 62]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 78]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 46]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:19:00,893 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