./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/nr3.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/nr3.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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:18:48,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:18:48,919 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:48,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:18:48,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:18:48,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:18:48,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:18:48,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:18:48,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:18:48,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:18:48,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:18:48,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:18:48,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:18:48,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:18:48,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:18:48,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:18:48,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:18:48,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:18:48,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:18:48,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:18:48,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:18:48,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:18:48,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:18:48,971 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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2025-02-06 13:18:49,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:18:49,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:18:49,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:18:49,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:18:49,226 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:18:49,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr3.c [2025-02-06 13:18:50,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e30e3663/e47c2eeccc2340e6b1b89f5cf87fc0fc/FLAGb89e7171b [2025-02-06 13:18:51,082 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:18:51,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2025-02-06 13:18:51,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e30e3663/e47c2eeccc2340e6b1b89f5cf87fc0fc/FLAGb89e7171b [2025-02-06 13:18:51,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e30e3663/e47c2eeccc2340e6b1b89f5cf87fc0fc [2025-02-06 13:18:51,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:18:51,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:18:51,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:18:51,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:18:51,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:18:51,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:51" (1/1) ... [2025-02-06 13:18:51,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e56fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51, skipping insertion in model container [2025-02-06 13:18:51,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:51" (1/1) ... [2025-02-06 13:18:51,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:18:51,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:18:51,480 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:18:51,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:18:51,509 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:18:51,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51 WrapperNode [2025-02-06 13:18:51,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:18:51,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:18:51,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:18:51,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:18:51,516 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:51" (1/1) ... [2025-02-06 13:18:51,521 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:51" (1/1) ... [2025-02-06 13:18:51,539 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-02-06 13:18:51,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:18:51,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:18:51,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:18:51,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:18:51,547 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:51" (1/1) ... [2025-02-06 13:18:51,548 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:51" (1/1) ... [2025-02-06 13:18:51,549 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:51" (1/1) ... [2025-02-06 13:18:51,564 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-06 13:18:51,566 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:51" (1/1) ... [2025-02-06 13:18:51,566 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:51" (1/1) ... [2025-02-06 13:18:51,570 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:51" (1/1) ... [2025-02-06 13:18:51,574 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:51" (1/1) ... [2025-02-06 13:18:51,575 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:51" (1/1) ... [2025-02-06 13:18:51,575 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:51" (1/1) ... [2025-02-06 13:18:51,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:18:51,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:18:51,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:18:51,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:18:51,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 13:18:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:18:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:51,614 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:51,617 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:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:18:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:18:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:18:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:18:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:18:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:18:51,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:18:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:18:51,696 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:18:51,697 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:18:51,909 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-06 13:18:51,909 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:18:51,919 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:18:51,920 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:18:51,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:51 BoogieIcfgContainer [2025-02-06 13:18:51,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:18:51,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:18:51,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:18:51,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:18:51,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:18:51" (1/3) ... [2025-02-06 13:18:51,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f422e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:51, skipping insertion in model container [2025-02-06 13:18:51,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (2/3) ... [2025-02-06 13:18:51,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f422e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:51, skipping insertion in model container [2025-02-06 13:18:51,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:51" (3/3) ... [2025-02-06 13:18:51,930 INFO L128 eAbstractionObserver]: Analyzing ICFG nr3.c [2025-02-06 13:18:51,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:18:51,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr3.c that has 1 procedures, 55 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-06 13:18:51,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:18:52,002 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;@3a540ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:18:52,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 13:18:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 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,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:18:52,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1994520381, now seen corresponding path program 1 times [2025-02-06 13:18:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107557485] [2025-02-06 13:18:52,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:18:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:18:52,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,138 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:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107557485] [2025-02-06 13:18:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107557485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:18:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746239185] [2025-02-06 13:18:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:18:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:18:52,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:18:52,155 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 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:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,164 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2025-02-06 13:18:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:18:52,165 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:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,169 INFO L225 Difference]: With dead ends: 104 [2025-02-06 13:18:52,169 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 13:18:52,171 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:52,172 INFO L435 NwaCegarLoop]: 60 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, 60 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:52,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 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:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 13:18:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 13:18:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.606060606060606) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-06 13:18:52,193 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2025-02-06 13:18:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,193 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-06 13:18:52,193 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:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-06 13:18:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:18:52,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:18:52,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1994550172, now seen corresponding path program 1 times [2025-02-06 13:18:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499856673] [2025-02-06 13:18:52,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:18:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:18:52,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,379 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:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499856673] [2025-02-06 13:18:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499856673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177054537] [2025-02-06 13:18:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:52,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:52,388 INFO L87 Difference]: Start difference. First operand 49 states and 53 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:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,417 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-06 13:18:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:52,418 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:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,418 INFO L225 Difference]: With dead ends: 49 [2025-02-06 13:18:52,418 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 13:18:52,419 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:52,419 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:52,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 45 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 13:18:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 13:18:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-06 13:18:52,425 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2025-02-06 13:18:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,425 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-06 13:18:52,426 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:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-06 13:18:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:18:52,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:18:52,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:52,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1701513209, now seen corresponding path program 1 times [2025-02-06 13:18:52,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006773345] [2025-02-06 13:18:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:18:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:18:52,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,651 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:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006773345] [2025-02-06 13:18:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006773345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:18:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023077245] [2025-02-06 13:18:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:52,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:52,652 INFO L87 Difference]: Start difference. First operand 48 states and 52 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:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,670 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-06 13:18:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:52,671 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:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,671 INFO L225 Difference]: With dead ends: 48 [2025-02-06 13:18:52,671 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 13:18:52,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:52,672 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:52,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 13:18:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 13:18:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-06 13:18:52,675 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 9 [2025-02-06 13:18:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-06 13:18:52,675 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:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-06 13:18:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:18:52,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:18:52,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:52,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 576000889, now seen corresponding path program 1 times [2025-02-06 13:18:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482063144] [2025-02-06 13:18:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:18:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:18:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,721 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:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482063144] [2025-02-06 13:18:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482063144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339931627] [2025-02-06 13:18:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:18:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:18:52,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:52,723 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 3 states, 3 states have (on average 4.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:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,767 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-02-06 13:18:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:18:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,768 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:52,768 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 13:18:52,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:52,770 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:52,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 13:18:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2025-02-06 13:18:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-06 13:18:52,777 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2025-02-06 13:18:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,777 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-06 13:18:52,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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,777 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-06 13:18:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:18:52,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:18:52,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:52,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash 676182187, now seen corresponding path program 1 times [2025-02-06 13:18:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615057448] [2025-02-06 13:18:52,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:18:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:18:52,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,818 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:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615057448] [2025-02-06 13:18:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615057448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:18:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792210659] [2025-02-06 13:18:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:18:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:18:52,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:52,819 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:52,875 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-02-06 13:18:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:18:52,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-06 13:18:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:52,876 INFO L225 Difference]: With dead ends: 72 [2025-02-06 13:18:52,876 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 13:18:52,876 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:52,876 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 14 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:52,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 13:18:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-02-06 13:18:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 65 states have internal predecessors, (79), 0 states have call successors, (0), 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,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-02-06 13:18:52,886 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 13 [2025-02-06 13:18:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:52,887 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-02-06 13:18:52,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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,887 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-02-06 13:18:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:18:52,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:52,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:52,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:18:52,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1271020073, now seen corresponding path program 1 times [2025-02-06 13:18:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222355918] [2025-02-06 13:18:52,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:18:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:18:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:52,942 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:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:52,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222355918] [2025-02-06 13:18:52,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222355918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:52,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:52,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981453229] [2025-02-06 13:18:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:52,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:52,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:52,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:52,944 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:53,030 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2025-02-06 13:18:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 13:18:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:53,031 INFO L225 Difference]: With dead ends: 82 [2025-02-06 13:18:53,031 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 13:18:53,031 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:53,032 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:53,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 13:18:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-02-06 13:18:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.459016393442623) internal successors, (89), 74 states have internal predecessors, (89), 0 states have call successors, (0), 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,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-02-06 13:18:53,038 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 15 [2025-02-06 13:18:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:53,038 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-02-06 13:18:53,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-02-06 13:18:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:18:53,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:53,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:53,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:18:53,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -851705900, now seen corresponding path program 1 times [2025-02-06 13:18:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785443625] [2025-02-06 13:18:53,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:53,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:18:53,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:18:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,145 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:53,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785443625] [2025-02-06 13:18:53,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785443625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290052446] [2025-02-06 13:18:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:53,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:53,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:53,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:53,150 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:53,211 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2025-02-06 13:18:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:53,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 13:18:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:53,214 INFO L225 Difference]: With dead ends: 84 [2025-02-06 13:18:53,214 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 13:18:53,215 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,217 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:53,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 13:18:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 13:18:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 81 states have internal predecessors, (97), 0 states have call successors, (0), 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2025-02-06 13:18:53,224 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 17 [2025-02-06 13:18:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-02-06 13:18:53,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2025-02-06 13:18:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:18:53,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:53,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:53,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:18:53,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 527311187, now seen corresponding path program 1 times [2025-02-06 13:18:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253624454] [2025-02-06 13:18:53,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:53,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:18:53,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:18:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,318 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:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253624454] [2025-02-06 13:18:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253624454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038777907] [2025-02-06 13:18:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:53,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:53,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:53,320 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:53,379 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2025-02-06 13:18:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:53,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 13:18:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:53,381 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:53,381 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:18:53,381 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,381 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:53,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 112 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:18:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-02-06 13:18:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 96 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2025-02-06 13:18:53,395 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 18 [2025-02-06 13:18:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:53,396 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2025-02-06 13:18:53,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2025-02-06 13:18:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 13:18:53,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:53,397 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] [2025-02-06 13:18:53,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:18:53,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:53,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1862803836, now seen corresponding path program 1 times [2025-02-06 13:18:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:53,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892504546] [2025-02-06 13:18:53,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:53,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:18:53,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:18:53,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:18:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892504546] [2025-02-06 13:18:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892504546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768422594] [2025-02-06 13:18:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:53,472 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:53,543 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2025-02-06 13:18:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 13:18:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:53,544 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:53,544 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:18:53,544 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,544 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:53,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:18:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-06 13:18:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 98 states have internal predecessors, (123), 0 states have call successors, (0), 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,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-02-06 13:18:53,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 21 [2025-02-06 13:18:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:53,558 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-02-06 13:18:53,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-02-06 13:18:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:18:53,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:53,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:53,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:18:53,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:53,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1000279123, now seen corresponding path program 1 times [2025-02-06 13:18:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:53,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525730323] [2025-02-06 13:18:53,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:53,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:18:53,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:18:53,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,718 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:53,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525730323] [2025-02-06 13:18:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525730323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:53,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:18:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606406171] [2025-02-06 13:18:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:53,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:53,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:53,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:53,720 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:53,786 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2025-02-06 13:18:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 13:18:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:53,789 INFO L225 Difference]: With dead ends: 118 [2025-02-06 13:18:53,789 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:18:53,789 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:53,790 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:53,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:18:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-06 13:18:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 98 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2025-02-06 13:18:53,801 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 24 [2025-02-06 13:18:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:53,801 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2025-02-06 13:18:53,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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,801 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2025-02-06 13:18:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:18:53,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:53,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:18:53,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:53,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 506236734, now seen corresponding path program 1 times [2025-02-06 13:18:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:53,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601393945] [2025-02-06 13:18:53,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:53,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:18:53,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:18:53,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601393945] [2025-02-06 13:18:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601393945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614710937] [2025-02-06 13:18:53,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:53,917 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:53,918 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:53,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:18:53,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:18:53,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:53,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:53,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:53,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:54,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614710937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 13:18:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119077150] [2025-02-06 13:18:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:18:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:54,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:18:54,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:54,061 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:54,150 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2025-02-06 13:18:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 13:18:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:54,151 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:54,151 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 13:18:54,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:54,152 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:54,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 13:18:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-06 13:18:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 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,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-02-06 13:18:54,162 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 24 [2025-02-06 13:18:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:54,162 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-02-06 13:18:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2025-02-06 13:18:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 13:18:54,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:54,162 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] [2025-02-06 13:18:54,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:54,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:18:54,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:54,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1486530432, now seen corresponding path program 1 times [2025-02-06 13:18:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342744008] [2025-02-06 13:18:54,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:54,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:18:54,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:18:54,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:54,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:18:54,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342744008] [2025-02-06 13:18:54,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342744008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:54,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:54,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:54,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856758030] [2025-02-06 13:18:54,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:54,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:54,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:54,417 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:54,465 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2025-02-06 13:18:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:54,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 13:18:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:54,466 INFO L225 Difference]: With dead ends: 101 [2025-02-06 13:18:54,467 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 13:18:54,467 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:54,467 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:54,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 13:18:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-02-06 13:18:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 97 states have internal predecessors, (116), 0 states have call successors, (0), 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,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2025-02-06 13:18:54,472 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 25 [2025-02-06 13:18:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:54,472 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2025-02-06 13:18:54,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2025-02-06 13:18:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:18:54,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:54,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:54,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:18:54,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:54,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1668364318, now seen corresponding path program 1 times [2025-02-06 13:18:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:54,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221487664] [2025-02-06 13:18:54,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:18:54,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:18:54,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:54,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:18:54,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221487664] [2025-02-06 13:18:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221487664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181977408] [2025-02-06 13:18:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:54,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:54,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:54,514 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:54,546 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2025-02-06 13:18:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:54,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-06 13:18:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:54,547 INFO L225 Difference]: With dead ends: 98 [2025-02-06 13:18:54,547 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 13:18:54,547 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,547 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:54,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 13:18:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-02-06 13:18:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 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,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2025-02-06 13:18:54,552 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 27 [2025-02-06 13:18:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2025-02-06 13:18:54,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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,552 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2025-02-06 13:18:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 13:18:54,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:54,553 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] [2025-02-06 13:18:54,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:18:54,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:54,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash -371096967, now seen corresponding path program 1 times [2025-02-06 13:18:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975891115] [2025-02-06 13:18:54,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:54,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:18:54,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:18:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975891115] [2025-02-06 13:18:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975891115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143442000] [2025-02-06 13:18:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:54,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:54,622 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:54,625 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:54,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:18:54,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:18:54,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:54,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:54,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:54,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:54,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143442000] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:54,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 13:18:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835072851] [2025-02-06 13:18:54,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:18:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:54,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:18:54,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:18:54,727 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:54,785 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2025-02-06 13:18:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:18:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 13:18:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:54,785 INFO L225 Difference]: With dead ends: 196 [2025-02-06 13:18:54,786 INFO L226 Difference]: Without dead ends: 134 [2025-02-06 13:18:54,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:18:54,786 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:54,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 154 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-06 13:18:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2025-02-06 13:18:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 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,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2025-02-06 13:18:54,792 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 29 [2025-02-06 13:18:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:54,792 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2025-02-06 13:18:54,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2025-02-06 13:18:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 13:18:54,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:54,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:54,800 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:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:54,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1158049255, now seen corresponding path program 2 times [2025-02-06 13:18:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855839975] [2025-02-06 13:18:54,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:55,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 13:18:55,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:18:55,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:18:55,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 13:18:55,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855839975] [2025-02-06 13:18:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855839975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131034549] [2025-02-06 13:18:55,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:55,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:55,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:55,131 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:55,133 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:55,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 13:18:55,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:18:55,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:18:55,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:18:55,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:18:55,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131034549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 11 [2025-02-06 13:18:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834108841] [2025-02-06 13:18:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:55,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:18:55,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:55,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:18:55,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:18:55,353 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 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,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:55,445 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2025-02-06 13:18:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:18:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-02-06 13:18:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:55,447 INFO L225 Difference]: With dead ends: 212 [2025-02-06 13:18:55,447 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 13:18:55,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:18:55,448 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:55,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 134 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 13:18:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2025-02-06 13:18:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 116 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:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2025-02-06 13:18:55,454 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 47 [2025-02-06 13:18:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:55,454 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2025-02-06 13:18:55,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 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,454 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2025-02-06 13:18:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 13:18:55,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:55,455 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:55,463 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:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:55,656 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash -281873864, now seen corresponding path program 1 times [2025-02-06 13:18:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249768415] [2025-02-06 13:18:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:55,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:18:55,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:18:55,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249768415] [2025-02-06 13:18:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249768415] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545472234] [2025-02-06 13:18:55,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:55,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:55,760 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:55,770 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:55,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:18:55,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:18:55,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:55,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:55,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:55,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545472234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:55,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:55,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:18:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148018243] [2025-02-06 13:18:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:55,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:55,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:55,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:18:55,902 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:55,961 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2025-02-06 13:18:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:55,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-06 13:18:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:55,962 INFO L225 Difference]: With dead ends: 117 [2025-02-06 13:18:55,962 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 13:18:55,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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:55,962 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:55,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 13:18:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 13:18:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 105 states have (on average 1.2571428571428571) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 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,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2025-02-06 13:18:55,967 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 47 [2025-02-06 13:18:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:55,968 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2025-02-06 13:18:55,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2025-02-06 13:18:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 13:18:55,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:55,968 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:55,976 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:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:18:56,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -148155190, now seen corresponding path program 1 times [2025-02-06 13:18:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744339363] [2025-02-06 13:18:56,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 13:18:56,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:18:56,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:56,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744339363] [2025-02-06 13:18:56,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744339363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:56,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135343418] [2025-02-06 13:18:56,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:56,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:56,220 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:56,221 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:56,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 13:18:56,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:18:56,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:56,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:56,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135343418] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:56,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:18:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496177330] [2025-02-06 13:18:56,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:18:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:18:56,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:56,373 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,467 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2025-02-06 13:18:56,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:18:56,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,468 INFO L225 Difference]: With dead ends: 169 [2025-02-06 13:18:56,468 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 13:18:56,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 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:56,468 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:56,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 146 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 13:18:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-06 13:18:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 157 states have (on average 1.2547770700636942) internal successors, (197), 165 states have internal predecessors, (197), 0 states have call successors, (0), 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,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2025-02-06 13:18:56,473 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 48 [2025-02-06 13:18:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,473 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2025-02-06 13:18:56,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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,473 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2025-02-06 13:18:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 13:18:56,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,474 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,479 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:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 13:18:56,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -297843594, now seen corresponding path program 1 times [2025-02-06 13:18:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398690669] [2025-02-06 13:18:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:18:56,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:18:56,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398690669] [2025-02-06 13:18:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398690669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287594625] [2025-02-06 13:18:56,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:56,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:56,749 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:56,755 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:56,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:18:56,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:18:56,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:56,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:56,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:56,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287594625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:56,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-06 13:18:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829091412] [2025-02-06 13:18:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:18:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:18:56,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:18:56,944 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,032 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2025-02-06 13:18:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:57,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-06 13:18:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,035 INFO L225 Difference]: With dead ends: 168 [2025-02-06 13:18:57,035 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 13:18:57,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:18:57,036 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 13:18:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-06 13:18:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 157 states have (on average 1.2292993630573248) internal successors, (193), 165 states have internal predecessors, (193), 0 states have call successors, (0), 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,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2025-02-06 13:18:57,048 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 49 [2025-02-06 13:18:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,048 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2025-02-06 13:18:57,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2025-02-06 13:18:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 13:18:57,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,049 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:57,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:57,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:18:57,251 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash -643216824, now seen corresponding path program 1 times [2025-02-06 13:18:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648537677] [2025-02-06 13:18:57,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 13:18:57,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 13:18:57,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648537677] [2025-02-06 13:18:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648537677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26723669] [2025-02-06 13:18:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:57,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:57,357 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,402 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2025-02-06 13:18:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-02-06 13:18:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,403 INFO L225 Difference]: With dead ends: 168 [2025-02-06 13:18:57,403 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 13:18:57,403 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:57,404 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 13:18:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-06 13:18:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 157 states have (on average 1.2038216560509554) internal successors, (189), 165 states have internal predecessors, (189), 0 states have call successors, (0), 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,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 189 transitions. [2025-02-06 13:18:57,416 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 189 transitions. Word has length 50 [2025-02-06 13:18:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,416 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 189 transitions. [2025-02-06 13:18:57,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 189 transitions. [2025-02-06 13:18:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 13:18:57,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 13:18:57,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:18:57,416 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:57,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash -150589440, now seen corresponding path program 1 times [2025-02-06 13:18:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629085228] [2025-02-06 13:18:57,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 13:18:57,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:18:57,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629085228] [2025-02-06 13:18:57,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629085228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459113405] [2025-02-06 13:18:57,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:57,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:57,506 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:57,508 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:57,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 13:18:57,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:18:57,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:57,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:57,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:57,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459113405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:57,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:18:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241344210] [2025-02-06 13:18:57,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:18:57,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:18:57,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:18:57,598 INFO L87 Difference]: Start difference. First operand 166 states and 189 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,663 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2025-02-06 13:18:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-06 13:18:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,665 INFO L225 Difference]: With dead ends: 166 [2025-02-06 13:18:57,665 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 13:18:57,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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,665 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 94 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 13:18:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-06 13:18:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 157 states have (on average 1.197452229299363) internal successors, (188), 164 states have internal predecessors, (188), 0 states have call successors, (0), 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,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2025-02-06 13:18:57,674 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 58 [2025-02-06 13:18:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,675 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2025-02-06 13:18:57,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2025-02-06 13:18:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 13:18:57,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,675 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:57,684 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:57,875 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:57,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:57,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1355926417, now seen corresponding path program 2 times [2025-02-06 13:18:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850528866] [2025-02-06 13:18:57,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-06 13:18:57,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:18:57,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:18:57,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850528866] [2025-02-06 13:18:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850528866] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041004424] [2025-02-06 13:18:57,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:57,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:57,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:57,964 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:57,966 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:57,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-06 13:18:58,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:18:58,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:18:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:18:58,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:18:58,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041004424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-02-06 13:18:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575683678] [2025-02-06 13:18:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:18:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:18:58,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:18:58,134 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,234 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2025-02-06 13:18:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:18:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-06 13:18:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,235 INFO L225 Difference]: With dead ends: 165 [2025-02-06 13:18:58,235 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 13:18:58,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:18:58,236 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:58,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 13:18:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-06 13:18:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 157 states have (on average 1.1592356687898089) internal successors, (182), 162 states have internal predecessors, (182), 0 states have call successors, (0), 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,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 182 transitions. [2025-02-06 13:18:58,240 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 182 transitions. Word has length 58 [2025-02-06 13:18:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 182 transitions. [2025-02-06 13:18:58,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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,240 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 182 transitions. [2025-02-06 13:18:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 13:18:58,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 13:18:58,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:18:58,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,445 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash -373305370, now seen corresponding path program 1 times [2025-02-06 13:18:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087314559] [2025-02-06 13:18:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 13:18:58,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 13:18:58,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087314559] [2025-02-06 13:18:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087314559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980702731] [2025-02-06 13:18:58,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:58,498 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:58,502 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:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 13:18:58,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 13:18:58,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:58,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:58,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 13:18:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980702731] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:58,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:58,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:18:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912911622] [2025-02-06 13:18:58,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:18:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:18:58,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:18:58,601 INFO L87 Difference]: Start difference. First operand 163 states and 182 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,683 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2025-02-06 13:18:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:18:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-06 13:18:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,683 INFO L225 Difference]: With dead ends: 185 [2025-02-06 13:18:58,683 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 13:18:58,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 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,685 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:58,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 185 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 13:18:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-06 13:18:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 178 states have (on average 1.1573033707865168) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 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,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2025-02-06 13:18:58,689 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 59 [2025-02-06 13:18:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,689 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2025-02-06 13:18:58,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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,689 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2025-02-06 13:18:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 13:18:58,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,689 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:58,699 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:58,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,890 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:58,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash -915954035, now seen corresponding path program 2 times [2025-02-06 13:18:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-02-06 13:18:58,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-06 13:18:58,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 59 statements. [2025-02-06 13:18:58,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:58,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 13:18:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-02-06 13:18:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154347991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:58,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:58,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:58,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053807475] [2025-02-06 13:18:58,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:58,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:58,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:58,910 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,941 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2025-02-06 13:18:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:58,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-06 13:18:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,942 INFO L225 Difference]: With dead ends: 184 [2025-02-06 13:18:58,942 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 13:18:58,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:58,942 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:58,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 13:18:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-02-06 13:18:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 178 states have (on average 1.1235955056179776) internal successors, (200), 181 states have internal predecessors, (200), 0 states have call successors, (0), 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,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 200 transitions. [2025-02-06 13:18:58,947 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 200 transitions. Word has length 59 [2025-02-06 13:18:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,947 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 200 transitions. [2025-02-06 13:18:58,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:18:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 200 transitions. [2025-02-06 13:18:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 13:18:58,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,947 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:58,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 13:18:58,948 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:58,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1751765733, now seen corresponding path program 2 times [2025-02-06 13:18:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621955710] [2025-02-06 13:18:58,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-02-06 13:18:58,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 80 statements. [2025-02-06 13:18:58,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:58,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 13:18:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621955710] [2025-02-06 13:18:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621955710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105025366] [2025-02-06 13:18:58,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:58,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:58,980 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,982 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:59,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-02-06 13:18:59,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 80 statements. [2025-02-06 13:18:59,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 13:18:59,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 13:18:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105025366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:59,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-06 13:18:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425349201] [2025-02-06 13:18:59,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:59,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:59,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:59,161 INFO L87 Difference]: Start difference. First operand 182 states and 200 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:59,203 INFO L93 Difference]: Finished difference Result 182 states and 200 transitions. [2025-02-06 13:18:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 80 [2025-02-06 13:18:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:59,203 INFO L225 Difference]: With dead ends: 182 [2025-02-06 13:18:59,203 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 13:18:59,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 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,204 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:59,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 13:18:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-06 13:18:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 142 states have (on average 1.091549295774648) internal successors, (155), 144 states have internal predecessors, (155), 0 states have call successors, (0), 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,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2025-02-06 13:18:59,208 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 80 [2025-02-06 13:18:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:59,208 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2025-02-06 13:18:59,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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,208 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2025-02-06 13:18:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 13:18:59,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:59,208 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:59,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:59,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 13:18:59,409 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:59,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2089829111, now seen corresponding path program 1 times [2025-02-06 13:18:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260734396] [2025-02-06 13:18:59,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:59,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 13:18:59,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 13:18:59,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:59,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-02-06 13:18:59,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260734396] [2025-02-06 13:18:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260734396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:59,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453458322] [2025-02-06 13:18:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:59,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:59,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:59,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:59,482 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:59,505 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2025-02-06 13:18:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 108 [2025-02-06 13:18:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:59,506 INFO L225 Difference]: With dead ends: 145 [2025-02-06 13:18:59,506 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 13:18:59,506 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:59,507 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:59,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 13:18:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-06 13:18:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.0845070422535212) internal successors, (154), 143 states have internal predecessors, (154), 0 states have call successors, (0), 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,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2025-02-06 13:18:59,510 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 108 [2025-02-06 13:18:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2025-02-06 13:18:59,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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,510 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2025-02-06 13:18:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 13:18:59,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:59,511 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 13:18:59,511 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:59,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1445386576, now seen corresponding path program 2 times [2025-02-06 13:18:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112872162] [2025-02-06 13:18:59,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:59,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-06 13:18:59,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 116 statements. [2025-02-06 13:18:59,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:59,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 13:18:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112872162] [2025-02-06 13:18:59,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112872162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756694146] [2025-02-06 13:18:59,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:59,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:59,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:59,606 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,607 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,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-06 13:18:59,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 116 statements. [2025-02-06 13:18:59,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:18:59,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:59,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 13:18:59,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 13:19:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756694146] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:00,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 8 [2025-02-06 13:19:00,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409054039] [2025-02-06 13:19:00,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:00,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:19:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:00,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:19:00,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:19:00,046 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 9 states, 8 states have (on average 10.75) internal successors, (86), 9 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:19:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:00,080 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2025-02-06 13:19:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:19:00,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 9 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 116 [2025-02-06 13:19:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:00,081 INFO L225 Difference]: With dead ends: 144 [2025-02-06 13:19:00,081 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:19:00,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:19:00,081 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:00,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:19:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:19:00,082 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,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:19:00,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2025-02-06 13:19:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:00,082 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:19:00,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 9 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:19:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:19:00,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-06 13:19:00,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-06 13:19:00,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-06 13:19:00,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-06 13:19:00,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:00,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 13:19:00,291 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:00,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:19:00,514 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:19:00,535 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,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:19:00,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:19:00,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:19:00,536 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:19:00,540 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:51" (3/4) ... [2025-02-06 13:19:00,541 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:19:00,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 13:19:00,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 13:19:00,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:19:00,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:19:00,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:19:00,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:19:00,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:19:00,630 INFO L158 Benchmark]: Toolchain (without parser) took 9278.66ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.5MB in the beginning and 156.1MB in the end (delta: -50.6MB). Peak memory consumption was 126.2MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,630 INFO L158 Benchmark]: CDTParser took 3.85ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:00,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.39ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.42ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.3MB in the end (delta: 912.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:00,631 INFO L158 Benchmark]: Boogie Preprocessor took 40.26ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,631 INFO L158 Benchmark]: IcfgBuilder took 339.91ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 75.9MB in the end (delta: 15.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,631 INFO L158 Benchmark]: TraceAbstraction took 8612.18ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 75.9MB in the beginning and 164.3MB in the end (delta: -88.4MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,631 INFO L158 Benchmark]: Witness Printer took 93.34ms. Allocated memory is still 318.8MB. Free memory was 164.3MB in the beginning and 156.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:00,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.85ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.39ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.42ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.3MB in the end (delta: 912.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.26ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 339.91ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 75.9MB in the end (delta: 15.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8612.18ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 75.9MB in the beginning and 164.3MB in the end (delta: -88.4MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Witness Printer took 93.34ms. Allocated memory is still 318.8MB. Free memory was 164.3MB in the beginning and 156.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 707 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 707 mSDsluCounter, 2149 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1259 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1763 IncrementalHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 890 mSDtfsCounter, 1763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1036 GetRequests, 919 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=22, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 55 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1644 NumberOfCodeBlocks, 1273 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1934 ConstructedInterpolants, 0 QuantifiedInterpolants, 6275 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 42 InterpolantComputations, 21 PerfectInterpolantSequences, 2139/2439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL)) || (((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((((((((((2 == j) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= MINVAL))) || (((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= i)) && (i <= 715827882)) && (2 <= MINVAL))) || ((((((j <= 1) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((2 == j) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (i <= 715827882)) && (2 <= MINVAL))) || (((((((j <= 1) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (i <= 715827882)) && (2 <= MINVAL))) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || (((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:19:00,655 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