./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/nr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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/nr4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:18:53,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:18:53,547 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:53,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:18:53,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:18:53,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:18:53,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:18:53,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:18:53,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:18:53,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:18:53,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:18:53,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:18:53,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:18:53,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:18:53,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:18:53,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:18:53,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:18:53,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:18:53,578 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 [2025-02-06 13:18:53,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:18:53,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:18:53,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:18:53,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:18:53,785 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:18:53,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr4.c [2025-02-06 13:18:54,900 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff171d144/3b18d527032241bd80699494c1e3d860/FLAGde97f1b7b [2025-02-06 13:18:55,178 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:18:55,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr4.c [2025-02-06 13:18:55,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff171d144/3b18d527032241bd80699494c1e3d860/FLAGde97f1b7b [2025-02-06 13:18:55,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff171d144/3b18d527032241bd80699494c1e3d860 [2025-02-06 13:18:55,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:18:55,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:18:55,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:18:55,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:18:55,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:18:55,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:55" (1/1) ... [2025-02-06 13:18:55,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82f62cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:55, skipping insertion in model container [2025-02-06 13:18:55,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:55" (1/1) ... [2025-02-06 13:18:55,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:18:55,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:18:55,618 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:18:55,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:18:55,648 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:18:55,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:55 WrapperNode [2025-02-06 13:18:55,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:18:55,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:18:55,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:18:55,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:18:55,654 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:55" (1/1) ... [2025-02-06 13:18:55,664 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:55" (1/1) ... [2025-02-06 13:18:55,678 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-02-06 13:18:55,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:18:55,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:18:55,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:18:55,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:18:55,685 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:55" (1/1) ... [2025-02-06 13:18:55,686 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:55" (1/1) ... [2025-02-06 13:18:55,687 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:55" (1/1) ... [2025-02-06 13:18:55,695 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:55,695 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:55" (1/1) ... [2025-02-06 13:18:55,695 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:55" (1/1) ... [2025-02-06 13:18:55,699 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:55" (1/1) ... [2025-02-06 13:18:55,699 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:55" (1/1) ... [2025-02-06 13:18:55,700 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:55" (1/1) ... [2025-02-06 13:18:55,700 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:55" (1/1) ... [2025-02-06 13:18:55,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:18:55,702 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:18:55,702 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:18:55,702 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:18:55,703 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:55" (1/1) ... [2025-02-06 13:18:55,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:18:55,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:55,726 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:55,728 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:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:18:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:18:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:18:55,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:18:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:18:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:18:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:18:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:18:55,791 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:18:55,793 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:18:55,924 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-06 13:18:55,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:18:55,931 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:18:55,931 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:18:55,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:55 BoogieIcfgContainer [2025-02-06 13:18:55,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:18:55,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:18:55,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:18:55,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:18:55,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:18:55" (1/3) ... [2025-02-06 13:18:55,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d505858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:55, skipping insertion in model container [2025-02-06 13:18:55,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:55" (2/3) ... [2025-02-06 13:18:55,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d505858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:55, skipping insertion in model container [2025-02-06 13:18:55,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:55" (3/3) ... [2025-02-06 13:18:55,938 INFO L128 eAbstractionObserver]: Analyzing ICFG nr4.c [2025-02-06 13:18:55,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:18:55,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr4.c that has 1 procedures, 55 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-06 13:18:55,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:18:55,995 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;@72e970ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:18:55,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 13:18:55,998 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:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:18:56,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,002 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:56,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1994520381, now seen corresponding path program 1 times [2025-02-06 13:18:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838268983] [2025-02-06 13:18:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:18:56,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:18:56,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,146 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:56,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838268983] [2025-02-06 13:18:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838268983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:18:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606993856] [2025-02-06 13:18:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:18:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:18:56,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:18:56,171 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:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,180 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2025-02-06 13:18:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:18:56,181 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:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,185 INFO L225 Difference]: With dead ends: 104 [2025-02-06 13:18:56,185 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 13:18:56,188 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:56,190 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:56,190 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:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 13:18:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 13:18:56,207 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:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-06 13:18:56,215 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2025-02-06 13:18:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-06 13:18:56,216 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:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-06 13:18:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:18:56,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:18:56,216 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:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1994550172, now seen corresponding path program 1 times [2025-02-06 13:18:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52849040] [2025-02-06 13:18:56,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:18:56,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:18:56,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,389 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:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52849040] [2025-02-06 13:18:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52849040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418788753] [2025-02-06 13:18:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:56,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:56,394 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:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,424 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-06 13:18:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:56,424 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:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,425 INFO L225 Difference]: With dead ends: 49 [2025-02-06 13:18:56,425 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 13:18:56,425 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:56,425 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:56,426 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:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 13:18:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 13:18:56,431 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:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-06 13:18:56,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2025-02-06 13:18:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,433 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-06 13:18:56,433 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:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-06 13:18:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:18:56,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:18:56,434 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:56,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1701513209, now seen corresponding path program 1 times [2025-02-06 13:18:56,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067030252] [2025-02-06 13:18:56,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:18:56,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:18:56,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,645 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:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067030252] [2025-02-06 13:18:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067030252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:18:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111773255] [2025-02-06 13:18:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:18:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:18:56,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:18:56,647 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,664 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-06 13:18:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,665 INFO L225 Difference]: With dead ends: 48 [2025-02-06 13:18:56,665 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 13:18:56,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:18:56,666 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:56,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 44 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 13:18:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 13:18:56,673 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:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-06 13:18:56,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 9 [2025-02-06 13:18:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,674 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-06 13:18:56,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-06 13:18:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:18:56,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:18:56,674 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:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 576000889, 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 [1585904655] [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,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:18:56,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:18:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,723 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:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585904655] [2025-02-06 13:18:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585904655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178447967] [2025-02-06 13:18:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:18:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:18:56,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:56,725 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:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,753 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-02-06 13:18:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:18:56,754 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:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,754 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:56,754 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 13:18:56,755 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:56,755 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:56,755 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:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 13:18:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2025-02-06 13:18:56,758 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:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-06 13:18:56,759 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2025-02-06 13:18:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,759 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-06 13:18:56,759 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:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-06 13:18:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:18:56,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:56,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:18:56,760 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:56,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash 676182187, now seen corresponding path program 1 times [2025-02-06 13:18:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820232144] [2025-02-06 13:18:56,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:18:56,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:18:56,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,789 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:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820232144] [2025-02-06 13:18:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820232144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:18:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426626055] [2025-02-06 13:18:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:18:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:18:56,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:18:56,790 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:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,838 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-02-06 13:18:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:18:56,838 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:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,839 INFO L225 Difference]: With dead ends: 72 [2025-02-06 13:18:56,839 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 13:18:56,839 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:56,839 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:56,840 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:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 13:18:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-02-06 13:18:56,843 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:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-02-06 13:18:56,844 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 13 [2025-02-06 13:18:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,844 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-02-06 13:18:56,844 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:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-02-06 13:18:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:18:56,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,844 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:56,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:18:56,845 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:56,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1271020073, now seen corresponding path program 1 times [2025-02-06 13:18:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399003637] [2025-02-06 13:18:56,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:18:56,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:18:56,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,885 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:56,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399003637] [2025-02-06 13:18:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399003637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430720675] [2025-02-06 13:18:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:56,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:56,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:56,886 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:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:56,944 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2025-02-06 13:18:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:56,944 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:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:56,944 INFO L225 Difference]: With dead ends: 82 [2025-02-06 13:18:56,944 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 13:18:56,945 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:56,945 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:56,945 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:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 13:18:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-02-06 13:18:56,949 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:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-02-06 13:18:56,949 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 15 [2025-02-06 13:18:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:56,949 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-02-06 13:18:56,949 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:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-02-06 13:18:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:18:56,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:56,950 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:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:18:56,950 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:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -851705900, now seen corresponding path program 1 times [2025-02-06 13:18:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040325279] [2025-02-06 13:18:56,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:18:56,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:18:56,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:56,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:56,991 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:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040325279] [2025-02-06 13:18:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040325279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:56,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:56,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717203449] [2025-02-06 13:18:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:56,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:56,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:56,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:56,992 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:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,029 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2025-02-06 13:18:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:57,030 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:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,031 INFO L225 Difference]: With dead ends: 84 [2025-02-06 13:18:57,031 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 13:18:57,031 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:57,032 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,032 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.0s Time] [2025-02-06 13:18:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 13:18:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 13:18:57,040 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:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2025-02-06 13:18:57,040 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 17 [2025-02-06 13:18:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-02-06 13:18:57,041 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:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2025-02-06 13:18:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:18:57,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,041 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:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:18:57,041 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:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 527311187, now seen corresponding path program 1 times [2025-02-06 13:18:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407302114] [2025-02-06 13:18:57,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:18:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:18:57,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,115 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:57,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407302114] [2025-02-06 13:18:57,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407302114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:57,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608987472] [2025-02-06 13:18:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:57,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:57,117 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:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,163 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2025-02-06 13:18:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:57,163 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:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,164 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:57,164 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:18:57,164 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:57,164 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,165 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.0s Time] [2025-02-06 13:18:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:18:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-02-06 13:18:57,174 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:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2025-02-06 13:18:57,175 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 18 [2025-02-06 13:18:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,175 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2025-02-06 13:18:57,175 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:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2025-02-06 13:18:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 13:18:57,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,178 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:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:18:57,178 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:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1862803836, now seen corresponding path program 1 times [2025-02-06 13:18:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535312511] [2025-02-06 13:18:57,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:18:57,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:18:57,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,226 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:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535312511] [2025-02-06 13:18:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535312511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774646315] [2025-02-06 13:18:57,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:57,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:57,228 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:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,280 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2025-02-06 13:18:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:57,280 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:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,281 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:57,281 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:18:57,281 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:57,282 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,282 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.0s Time] [2025-02-06 13:18:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:18:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-06 13:18:57,292 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:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-02-06 13:18:57,293 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 21 [2025-02-06 13:18:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,293 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-02-06 13:18:57,293 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:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-02-06 13:18:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:18:57,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,294 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:57,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:18:57,294 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:57,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1000279123, now seen corresponding path program 1 times [2025-02-06 13:18:57,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56497731] [2025-02-06 13:18:57,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:18:57,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:18:57,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,407 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:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56497731] [2025-02-06 13:18:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56497731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:18:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045083229] [2025-02-06 13:18:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:18:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:18:57,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:18:57,409 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:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,457 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2025-02-06 13:18:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:18:57,458 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:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,458 INFO L225 Difference]: With dead ends: 118 [2025-02-06 13:18:57,458 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:18:57,459 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:57,459 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 51 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:18:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-06 13:18:57,463 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:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2025-02-06 13:18:57,463 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 24 [2025-02-06 13:18:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2025-02-06 13:18:57,463 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:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2025-02-06 13:18:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:18:57,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,464 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:57,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:18:57,464 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:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 506236734, now seen corresponding path program 1 times [2025-02-06 13:18:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955935446] [2025-02-06 13:18:57,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:57,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:18:57,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:18:57,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,549 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:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955935446] [2025-02-06 13:18:57,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955935446] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:57,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465713698] [2025-02-06 13:18:57,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:57,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:57,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:57,556 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:57,557 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:57,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:18:57,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:18:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:57,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:18:57,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:57,694 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:57,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465713698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:57,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:57,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 13:18:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956289567] [2025-02-06 13:18:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:57,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:18:57,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:57,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:18:57,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:57,695 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:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:57,796 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2025-02-06 13:18:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:18:57,796 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:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:57,798 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:18:57,798 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 13:18:57,798 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:57,798 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:57,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 13:18:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-06 13:18:57,805 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:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-02-06 13:18:57,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 24 [2025-02-06 13:18:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:57,806 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-02-06 13:18:57,806 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:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2025-02-06 13:18:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 13:18:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:57,806 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:57,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:18:58,011 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:58,011 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:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1486530432, now seen corresponding path program 1 times [2025-02-06 13:18:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246818051] [2025-02-06 13:18:58,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:18:58,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:18:58,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,055 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:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246818051] [2025-02-06 13:18:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246818051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593907141] [2025-02-06 13:18:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:58,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:58,056 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:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,109 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2025-02-06 13:18:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:58,109 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:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,110 INFO L225 Difference]: With dead ends: 101 [2025-02-06 13:18:58,110 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 13:18:58,110 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:58,110 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:58,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:18:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 13:18:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-02-06 13:18:58,113 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:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2025-02-06 13:18:58,113 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 25 [2025-02-06 13:18:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,113 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2025-02-06 13:18:58,113 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:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2025-02-06 13:18:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:18:58,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,114 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:58,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:18:58,114 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:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1668364318, now seen corresponding path program 1 times [2025-02-06 13:18:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862603470] [2025-02-06 13:18:58,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:18:58,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:18:58,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,146 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:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862603470] [2025-02-06 13:18:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862603470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:58,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:18:58,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:18:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540736622] [2025-02-06 13:18:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:18:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:18:58,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:18:58,147 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:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,190 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2025-02-06 13:18:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:18:58,191 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:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,191 INFO L225 Difference]: With dead ends: 98 [2025-02-06 13:18:58,191 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 13:18:58,192 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:58,192 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:58,192 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:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 13:18:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-02-06 13:18:58,199 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:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2025-02-06 13:18:58,200 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 27 [2025-02-06 13:18:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,200 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2025-02-06 13:18:58,200 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:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2025-02-06 13:18:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 13:18:58,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,200 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:58,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:18:58,201 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:58,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash -371096967, now seen corresponding path program 1 times [2025-02-06 13:18:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238087023] [2025-02-06 13:18:58,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:18:58,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:18:58,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,285 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:58,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238087023] [2025-02-06 13:18:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238087023] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067398397] [2025-02-06 13:18:58,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:58,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:58,291 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:58,294 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:58,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:18:58,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:18:58,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:58,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:18:58,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:58,365 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:58,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:58,399 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:58,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067398397] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:58,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:58,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 13:18:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839947192] [2025-02-06 13:18:58,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:58,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:18:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:58,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:18:58,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:18:58,400 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:58,468 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2025-02-06 13:18:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:18:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:58,470 INFO L225 Difference]: With dead ends: 196 [2025-02-06 13:18:58,471 INFO L226 Difference]: Without dead ends: 134 [2025-02-06 13:18:58,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 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:58,471 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:58,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 173 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:18:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-06 13:18:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2025-02-06 13:18:58,477 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:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2025-02-06 13:18:58,478 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 29 [2025-02-06 13:18:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:58,478 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2025-02-06 13:18:58,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2025-02-06 13:18:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 13:18:58,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:58,480 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:58,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:18:58,685 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:58,685 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:58,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1158049255, now seen corresponding path program 2 times [2025-02-06 13:18:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000555637] [2025-02-06 13:18:58,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:58,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 13:18:58,724 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:58,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:18:58,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,830 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:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000555637] [2025-02-06 13:18:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000555637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385160919] [2025-02-06 13:18:58,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:18:58,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:58,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:58,832 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:58,841 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:58,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 13:18:58,908 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:58,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:18:58,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:58,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:18:58,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:59,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:18:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:18:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385160919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:18:59,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:18:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 12 [2025-02-06 13:18:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078411841] [2025-02-06 13:18:59,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:18:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:18:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:59,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:18:59,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:18:59,085 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:18:59,404 INFO L93 Difference]: Finished difference Result 298 states and 392 transitions. [2025-02-06 13:18:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 13:18:59,404 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:18:59,405 INFO L225 Difference]: With dead ends: 298 [2025-02-06 13:18:59,405 INFO L226 Difference]: Without dead ends: 222 [2025-02-06 13:18:59,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:18:59,406 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 257 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:18:59,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 134 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:18:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-06 13:18:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2025-02-06 13:18:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 196 states have (on average 1.433673469387755) internal successors, (281), 208 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 281 transitions. [2025-02-06 13:18:59,414 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 281 transitions. Word has length 47 [2025-02-06 13:18:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:18:59,414 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 281 transitions. [2025-02-06 13:18:59,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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,414 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 281 transitions. [2025-02-06 13:18:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 13:18:59,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:18:59,415 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:18:59,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:18:59,615 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:59,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:18:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:18:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -691531116, now seen corresponding path program 1 times [2025-02-06 13:18:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:18:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532598750] [2025-02-06 13:18:59,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:18:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 13:18:59,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 13:18:59,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:59,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-06 13:18:59,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:18:59,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532598750] [2025-02-06 13:18:59,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532598750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:18:59,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895996620] [2025-02-06 13:18:59,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:18:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:18:59,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:18:59,771 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:59,777 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:59,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 13:18:59,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 13:18:59,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:18:59,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:18:59,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:18:59,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:18:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:18:59,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:18:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895996620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:18:59,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:18:59,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-06 13:18:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185058012] [2025-02-06 13:18:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:18:59,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:18:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:18:59,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:18:59,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:18:59,992 INFO L87 Difference]: Start difference. First operand 209 states and 281 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:00,111 INFO L93 Difference]: Finished difference Result 365 states and 490 transitions. [2025-02-06 13:19:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:19:00,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-06 13:19:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:00,113 INFO L225 Difference]: With dead ends: 365 [2025-02-06 13:19:00,113 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 13:19:00,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:19:00,113 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 55 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:00,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 210 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 13:19:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 196. [2025-02-06 13:19:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 184 states have (on average 1.375) internal successors, (253), 195 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2025-02-06 13:19:00,125 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 57 [2025-02-06 13:19:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:00,125 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2025-02-06 13:19:00,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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,125 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2025-02-06 13:19:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 13:19:00,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:00,126 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:00,135 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:19:00,326 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:19:00,327 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:19:00,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 700102229, now seen corresponding path program 1 times [2025-02-06 13:19:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348856154] [2025-02-06 13:19:00,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:00,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 13:19:00,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 13:19:00,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:00,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:19:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348856154] [2025-02-06 13:19:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348856154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799990375] [2025-02-06 13:19:00,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:00,418 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:19:00,419 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:19:00,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 13:19:00,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 13:19:00,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:00,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:00,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:00,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:19:00,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:19:00,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799990375] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:00,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:00,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:19:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979692698] [2025-02-06 13:19:00,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:19:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:00,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:19:00,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:19:00,600 INFO L87 Difference]: Start difference. First operand 196 states and 253 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:19:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:00,697 INFO L93 Difference]: Finished difference Result 211 states and 273 transitions. [2025-02-06 13:19:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:19:00,697 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 57 [2025-02-06 13:19:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:00,701 INFO L225 Difference]: With dead ends: 211 [2025-02-06 13:19:00,702 INFO L226 Difference]: Without dead ends: 208 [2025-02-06 13:19:00,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 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:19:00,702 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:00,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 120 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-06 13:19:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-06 13:19:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 196 states have (on average 1.316326530612245) internal successors, (258), 207 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2025-02-06 13:19:00,716 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 57 [2025-02-06 13:19:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:00,716 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2025-02-06 13:19:00,716 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:19:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2025-02-06 13:19:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 13:19:00,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:00,721 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:19:00,734 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:19:00,921 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:19:00,921 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:19:00,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 228332619, now seen corresponding path program 1 times [2025-02-06 13:19:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:00,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118707801] [2025-02-06 13:19:00,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:00,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 13:19:00,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:19:00,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:00,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:19:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118707801] [2025-02-06 13:19:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118707801] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531408857] [2025-02-06 13:19:01,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:01,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:01,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:01,042 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:19:01,049 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:19:01,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 13:19:01,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:19:01,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:01,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:19:01,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:19:01,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:01,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531408857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:01,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:01,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-06 13:19:01,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274197135] [2025-02-06 13:19:01,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:01,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:19:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:01,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:19:01,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:19:01,196 INFO L87 Difference]: Start difference. First operand 208 states and 258 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:19:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:01,271 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2025-02-06 13:19:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:19:01,272 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 58 [2025-02-06 13:19:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:01,273 INFO L225 Difference]: With dead ends: 210 [2025-02-06 13:19:01,273 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 13:19:01,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 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:19:01,275 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:01,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 92 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 13:19:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 13:19:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 196 states have (on average 1.239795918367347) internal successors, (243), 204 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 243 transitions. [2025-02-06 13:19:01,284 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 243 transitions. Word has length 58 [2025-02-06 13:19:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:01,284 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 243 transitions. [2025-02-06 13:19:01,284 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:19:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 243 transitions. [2025-02-06 13:19:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 13:19:01,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:01,284 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:19:01,292 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:19:01,485 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:19:01,485 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:19:01,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:01,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1511623405, now seen corresponding path program 1 times [2025-02-06 13:19:01,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:01,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705957886] [2025-02-06 13:19:01,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:01,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:01,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 13:19:01,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 13:19:01,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705957886] [2025-02-06 13:19:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705957886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73015020] [2025-02-06 13:19:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:01,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:01,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:01,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:01,536 INFO L87 Difference]: Start difference. First operand 205 states and 243 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:19:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:01,575 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2025-02-06 13:19:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:01,575 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 59 [2025-02-06 13:19:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:01,576 INFO L225 Difference]: With dead ends: 207 [2025-02-06 13:19:01,576 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 13:19:01,576 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:19:01,577 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:01,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 13:19:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 13:19:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 196 states have (on average 1.219387755102041) internal successors, (239), 204 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 239 transitions. [2025-02-06 13:19:01,582 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 239 transitions. Word has length 59 [2025-02-06 13:19:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:01,582 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 239 transitions. [2025-02-06 13:19:01,582 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:19:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 239 transitions. [2025-02-06 13:19:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 13:19:01,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:01,583 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:01,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:19:01,583 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:19:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 45965259, now seen corresponding path program 1 times [2025-02-06 13:19:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608522857] [2025-02-06 13:19:01,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:01,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 13:19:01,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:19:01,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:01,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608522857] [2025-02-06 13:19:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608522857] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851130304] [2025-02-06 13:19:01,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:01,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:01,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:01,648 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:19:01,648 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:19:01,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 13:19:01,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:19:01,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:01,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:01,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:19:01,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:01,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851130304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:01,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:01,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:19:01,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264291707] [2025-02-06 13:19:01,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:01,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:19:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:01,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:19:01,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:19:01,726 INFO L87 Difference]: Start difference. First operand 205 states and 239 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:19:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:01,768 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2025-02-06 13:19:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:19:01,769 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 67 [2025-02-06 13:19:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:01,769 INFO L225 Difference]: With dead ends: 205 [2025-02-06 13:19:01,769 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 13:19:01,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 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:19:01,770 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:01,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 80 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 13:19:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 13:19:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 196 states have (on average 1.2142857142857142) internal successors, (238), 203 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 238 transitions. [2025-02-06 13:19:01,777 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 238 transitions. Word has length 67 [2025-02-06 13:19:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:01,778 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 238 transitions. [2025-02-06 13:19:01,778 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:19:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 238 transitions. [2025-02-06 13:19:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 13:19:01,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:01,778 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:01,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:19:01,979 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:19:01,979 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:19:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1552481116, now seen corresponding path program 2 times [2025-02-06 13:19:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110022134] [2025-02-06 13:19:01,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:01,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-06 13:19:01,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:19:01,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:19:01,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110022134] [2025-02-06 13:19:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110022134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816361167] [2025-02-06 13:19:02,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:02,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:02,050 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:19:02,055 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:19:02,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-06 13:19:02,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:19:02,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:19:02,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:02,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:19:02,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:19:02,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816361167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-02-06 13:19:02,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970084699] [2025-02-06 13:19:02,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:02,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:19:02,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:02,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:19:02,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:19:02,209 INFO L87 Difference]: Start difference. First operand 204 states and 238 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:19:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:02,405 INFO L93 Difference]: Finished difference Result 204 states and 238 transitions. [2025-02-06 13:19:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:19:02,406 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 67 [2025-02-06 13:19:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:02,407 INFO L225 Difference]: With dead ends: 204 [2025-02-06 13:19:02,407 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 13:19:02,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:19:02,407 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:02,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 103 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:19:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 13:19:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-06 13:19:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.163265306122449) internal successors, (228), 201 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 228 transitions. [2025-02-06 13:19:02,419 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 228 transitions. Word has length 67 [2025-02-06 13:19:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:02,419 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 228 transitions. [2025-02-06 13:19:02,419 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:19:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 228 transitions. [2025-02-06 13:19:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 13:19:02,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:02,419 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:02,434 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:19:02,620 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:19:02,621 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:19:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1424923003, now seen corresponding path program 1 times [2025-02-06 13:19:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396642293] [2025-02-06 13:19:02,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:02,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 13:19:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 13:19:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396642293] [2025-02-06 13:19:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396642293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504533336] [2025-02-06 13:19:02,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:02,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:02,713 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:19:02,715 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:19:02,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 13:19:02,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 13:19:02,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:02,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:02,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:19:02,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:02,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504533336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:02,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:19:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405897410] [2025-02-06 13:19:02,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:02,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:19:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:02,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:19:02,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:19:02,870 INFO L87 Difference]: Start difference. First operand 202 states and 228 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:19:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:02,978 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2025-02-06 13:19:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:19:02,979 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 68 [2025-02-06 13:19:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:02,980 INFO L225 Difference]: With dead ends: 224 [2025-02-06 13:19:02,980 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 13:19:02,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 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:19:02,982 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 53 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:02,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 149 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 13:19:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-06 13:19:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.1612903225806452) internal successors, (252), 222 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2025-02-06 13:19:02,990 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 68 [2025-02-06 13:19:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:02,990 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2025-02-06 13:19:02,990 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:19:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2025-02-06 13:19:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 13:19:02,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:02,991 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:02,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:03,191 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:19:03,192 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:19:03,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 882274338, now seen corresponding path program 2 times [2025-02-06 13:19:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:03,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807559527] [2025-02-06 13:19:03,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:03,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 13:19:03,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 68 statements. [2025-02-06 13:19:03,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-06 13:19:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807559527] [2025-02-06 13:19:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807559527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227884118] [2025-02-06 13:19:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:03,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:03,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:03,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:03,215 INFO L87 Difference]: Start difference. First operand 223 states and 252 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:19:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:03,251 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2025-02-06 13:19:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:03,251 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 68 [2025-02-06 13:19:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:03,252 INFO L225 Difference]: With dead ends: 223 [2025-02-06 13:19:03,252 INFO L226 Difference]: Without dead ends: 221 [2025-02-06 13:19:03,253 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:19:03,253 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:19:03,253 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:19:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-06 13:19:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-06 13:19:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 217 states have (on average 1.1152073732718895) internal successors, (242), 220 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2025-02-06 13:19:03,260 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 68 [2025-02-06 13:19:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:03,260 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2025-02-06 13:19:03,261 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:19:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2025-02-06 13:19:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 13:19:03,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:03,261 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 13:19:03,262 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:19:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1319614352, now seen corresponding path program 2 times [2025-02-06 13:19:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177249594] [2025-02-06 13:19:03,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:03,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 13:19:03,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 89 statements. [2025-02-06 13:19:03,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:03,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 13:19:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177249594] [2025-02-06 13:19:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177249594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458001458] [2025-02-06 13:19:03,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:03,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:03,310 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:19:03,311 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:19:03,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 13:19:03,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 89 statements. [2025-02-06 13:19:03,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:03,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:03,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:03,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 13:19:03,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 13:19:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458001458] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:03,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-06 13:19:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060117533] [2025-02-06 13:19:03,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:03,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:19:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:03,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:19:03,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:19:03,526 INFO L87 Difference]: Start difference. First operand 221 states and 242 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:19:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:03,582 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2025-02-06 13:19:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:19:03,583 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 89 [2025-02-06 13:19:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:03,584 INFO L225 Difference]: With dead ends: 221 [2025-02-06 13:19:03,584 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 13:19:03,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 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:19:03,585 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:19:03,586 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:19:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 13:19:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-06 13:19:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.0883977900552486) internal successors, (197), 183 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:19:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2025-02-06 13:19:03,593 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 89 [2025-02-06 13:19:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:03,593 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2025-02-06 13:19:03,593 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:19:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2025-02-06 13:19:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 13:19:03,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:03,595 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:03,606 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:19:03,796 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:19:03,796 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:19:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -860072356, now seen corresponding path program 1 times [2025-02-06 13:19:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280963995] [2025-02-06 13:19:03,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:03,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 13:19:03,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 13:19:03,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:03,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-06 13:19:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280963995] [2025-02-06 13:19:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280963995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352549108] [2025-02-06 13:19:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:03,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:03,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:03,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:03,872 INFO L87 Difference]: Start difference. First operand 184 states and 197 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:19:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:03,897 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2025-02-06 13:19:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:03,897 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 135 [2025-02-06 13:19:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:03,898 INFO L225 Difference]: With dead ends: 184 [2025-02-06 13:19:03,898 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 13:19:03,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:03,898 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:19:03,898 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:19:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 13:19:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-06 13:19:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.0828729281767955) internal successors, (196), 182 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2025-02-06 13:19:03,905 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 135 [2025-02-06 13:19:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:03,905 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2025-02-06 13:19:03,905 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:19:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2025-02-06 13:19:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 13:19:03,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:03,906 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 10, 10, 9, 9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:03,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 13:19:03,906 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:19:03,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1589508843, now seen corresponding path program 2 times [2025-02-06 13:19:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173631163] [2025-02-06 13:19:03,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:03,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 13:19:03,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 143 statements. [2025-02-06 13:19:03,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:03,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-06 13:19:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173631163] [2025-02-06 13:19:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173631163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104815026] [2025-02-06 13:19:03,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:03,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:04,000 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:19:04,004 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:19:04,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 13:19:04,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 143 statements. [2025-02-06 13:19:04,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:04,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:04,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:04,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-02-06 13:19:04,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-02-06 13:19:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104815026] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:04,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 8 [2025-02-06 13:19:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900283178] [2025-02-06 13:19:04,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:04,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:19:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:04,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:19:04,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:19:04,628 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 9 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:19:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:04,667 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2025-02-06 13:19:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:19:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 9 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 143 [2025-02-06 13:19:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:04,668 INFO L225 Difference]: With dead ends: 183 [2025-02-06 13:19:04,668 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:19:04,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:19:04,669 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:04,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:19:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:19:04,670 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:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:19:04,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-02-06 13:19:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:19:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 9 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:19:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:19:04,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:19:04,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-06 13:19:04,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-06 13:19:04,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-06 13:19:04,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-06 13:19:04,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-06 13:19:04,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-06 13:19:04,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-06 13:19:04,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-06 13:19:04,683 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:04,875 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:04,879 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:04,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:19:05,238 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:19:05,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:19:05 BoogieIcfgContainer [2025-02-06 13:19:05,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:19:05,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:19:05,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:19:05,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:19:05,255 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:55" (3/4) ... [2025-02-06 13:19:05,256 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:19:05,276 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 13:19:05,276 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 13:19:05,277 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:19:05,277 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:19:05,374 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:19:05,374 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:19:05,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:19:05,375 INFO L158 Benchmark]: Toolchain (without parser) took 9875.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.2MB in the beginning and 236.2MB in the end (delta: -125.9MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2025-02-06 13:19:05,376 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:05,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.72ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 99.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:05,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.25ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:05,377 INFO L158 Benchmark]: Boogie Preprocessor took 22.01ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:05,377 INFO L158 Benchmark]: IcfgBuilder took 230.16ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 81.3MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:05,379 INFO L158 Benchmark]: TraceAbstraction took 9319.74ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 81.2MB in the beginning and 244.3MB in the end (delta: -163.2MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. [2025-02-06 13:19:05,379 INFO L158 Benchmark]: Witness Printer took 120.77ms. Allocated memory is still 285.2MB. Free memory was 244.3MB in the beginning and 236.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:05,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.72ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 99.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.25ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.01ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 230.16ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 81.3MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9319.74ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 81.2MB in the beginning and 244.3MB in the end (delta: -163.2MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. * Witness Printer took 120.77ms. Allocated memory is still 285.2MB. Free memory was 244.3MB in the beginning and 236.2MB 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.9s, OverallIterations: 26, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 975 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 975 mSDsluCounter, 2255 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1365 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2107 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 890 mSDtfsCounter, 2107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1241 GetRequests, 1096 SyntacticMatches, 10 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=22, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 72 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1871 NumberOfCodeBlocks, 1419 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2261 ConstructedInterpolants, 0 QuantifiedInterpolants, 7544 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 3631/4058 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((2 <= CELLCOUNT) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || (((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((((((((((((((i <= 536870911) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= i)) && (2 <= MINVAL)) || ((((((2 == j) && (2 <= CELLCOUNT)) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((2 == j) && (i <= 536870911)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) || ((((((2 <= CELLCOUNT) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= MINVAL))) || ((((((j == 4) && (2 <= CELLCOUNT)) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((j == 4) && (i <= 536870911)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) || ((((((j <= 1) && (2 <= CELLCOUNT)) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((j <= 1) && (i <= 536870911)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL))) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || (((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:19:05,404 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