./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/diff-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/diff-2-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cb0d07e46dc94102f1a204dcfe0d8cca3d45653b0db7cea07d03c16ba8563271 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:36:48,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:36:48,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:36:48,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:36:48,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:36:48,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:36:48,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:36:48,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:36:48,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:36:48,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:36:48,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:36:48,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:36:48,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:36:48,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:36:48,562 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:36:48,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:36:48,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:36:48,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:36:48,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:36:48,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:36:48,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:36:48,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:36:48,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:36:48,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:36:48,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:36:48,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:48,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:36:48,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:36:48,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:36:48,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:36:48,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:36:48,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:36:48,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:36:48,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:36:48,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:36:48,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:36:48,566 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/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 -> cb0d07e46dc94102f1a204dcfe0d8cca3d45653b0db7cea07d03c16ba8563271 [2025-03-09 01:36:48,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:36:48,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:36:48,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:36:48,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:36:48,824 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:36:48,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/diff-2-n-u.c [2025-03-09 01:36:49,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6e31188/4c6d28a903ae46829638fbd310572e3b/FLAG14058c6e5 [2025-03-09 01:36:50,188 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:36:50,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/diff-2-n-u.c [2025-03-09 01:36:50,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6e31188/4c6d28a903ae46829638fbd310572e3b/FLAG14058c6e5 [2025-03-09 01:36:50,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6e31188/4c6d28a903ae46829638fbd310572e3b [2025-03-09 01:36:50,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:36:50,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:36:50,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:50,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:36:50,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:36:50,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97b1348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50, skipping insertion in model container [2025-03-09 01:36:50,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:36:50,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:50,678 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:36:50,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:50,705 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:36:50,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50 WrapperNode [2025-03-09 01:36:50,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:50,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:50,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:36:50,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:36:50,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,726 INFO L138 Inliner]: procedures = 14, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2025-03-09 01:36:50,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:50,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:36:50,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:36:50,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:36:50,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,744 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 4, 4]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 2, 2]. [2025-03-09 01:36:50,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:36:50,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:36:50,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:36:50,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:36:50,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (1/1) ... [2025-03-09 01:36:50,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:50,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:50,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:36:50,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:36:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:36:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:36:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:36:50,851 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:36:50,853 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:36:51,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset;call ULTIMATE.dealloc(main_~#C~0#1.base, main_~#C~0#1.offset);havoc main_~#C~0#1.base, main_~#C~0#1.offset; [2025-03-09 01:36:51,044 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-09 01:36:51,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:36:51,058 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:36:51,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:36:51,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:51 BoogieIcfgContainer [2025-03-09 01:36:51,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:36:51,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:36:51,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:36:51,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:36:51,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:36:50" (1/3) ... [2025-03-09 01:36:51,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6d5380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:51, skipping insertion in model container [2025-03-09 01:36:51,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:50" (2/3) ... [2025-03-09 01:36:51,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6d5380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:51, skipping insertion in model container [2025-03-09 01:36:51,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:51" (3/3) ... [2025-03-09 01:36:51,067 INFO L128 eAbstractionObserver]: Analyzing ICFG diff-2-n-u.c [2025-03-09 01:36:51,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:36:51,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diff-2-n-u.c that has 1 procedures, 49 locations, 1 initial locations, 8 loop locations, and 16 error locations. [2025-03-09 01:36:51,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:36:51,133 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;@502d14f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:36:51,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 01:36:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.78125) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:51,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:51,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:51,139 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-03-09 01:36:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash 83946999, now seen corresponding path program 1 times [2025-03-09 01:36:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:51,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606396226] [2025-03-09 01:36:51,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:51,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:51,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:51,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:51,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606396226] [2025-03-09 01:36:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606396226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678353894] [2025-03-09 01:36:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:51,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:51,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:51,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:51,330 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.78125) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:51,395 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2025-03-09 01:36:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:51,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-09 01:36:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:51,401 INFO L225 Difference]: With dead ends: 86 [2025-03-09 01:36:51,401 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 01:36:51,403 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-03-09 01:36:51,406 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:51,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 01:36:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-09 01:36:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-03-09 01:36:51,438 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 5 [2025-03-09 01:36:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:51,438 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-03-09 01:36:51,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-03-09 01:36:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:51,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:51,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:51,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:36:51,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 83947026, now seen corresponding path program 1 times [2025-03-09 01:36:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210545566] [2025-03-09 01:36:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:51,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:51,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:51,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:51,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210545566] [2025-03-09 01:36:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210545566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566095396] [2025-03-09 01:36:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:51,519 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:51,587 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2025-03-09 01:36:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:51,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-09 01:36:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:51,588 INFO L225 Difference]: With dead ends: 114 [2025-03-09 01:36:51,588 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 01:36:51,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03-09 01:36:51,590 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:51,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 01:36:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-09 01:36:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-09 01:36:51,597 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 5 [2025-03-09 01:36:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:51,597 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-09 01:36:51,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-09 01:36:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:51,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:51,598 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:36:51,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1194100923, now seen corresponding path program 1 times [2025-03-09 01:36:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132251359] [2025-03-09 01:36:51,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:51,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:51,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:51,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132251359] [2025-03-09 01:36:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132251359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060269500] [2025-03-09 01:36:51,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:51,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:51,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:36:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:51,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:51,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:51,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:51,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:51,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:36:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060269500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:51,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:36:51,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:36:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277598649] [2025-03-09 01:36:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:51,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:51,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:51,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:51,786 INFO L87 Difference]: Start difference. First operand 58 states and 65 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-03-09 01:36:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:51,844 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-03-09 01:36:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:51,845 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-03-09 01:36:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:51,845 INFO L225 Difference]: With dead ends: 58 [2025-03-09 01:36:51,845 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 01:36:51,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-03-09 01:36:51,846 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:51,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 01:36:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-09 01:36:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-09 01:36:51,851 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 8 [2025-03-09 01:36:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:51,851 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-09 01:36:51,851 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-03-09 01:36:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-09 01:36:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:51,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:51,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:51,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:36:52,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:52,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:52,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1194100950, now seen corresponding path program 1 times [2025-03-09 01:36:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438495905] [2025-03-09 01:36:52,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:52,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:52,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:36:52,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:52,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438495905] [2025-03-09 01:36:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438495905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622374500] [2025-03-09 01:36:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:52,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:52,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:52,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:52,099 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:52,163 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2025-03-09 01:36:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:36:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:52,164 INFO L225 Difference]: With dead ends: 106 [2025-03-09 01:36:52,165 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 01:36:52,165 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-03-09 01:36:52,165 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:52,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 47 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 01:36:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2025-03-09 01:36:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 93 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2025-03-09 01:36:52,179 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 8 [2025-03-09 01:36:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:52,179 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2025-03-09 01:36:52,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2025-03-09 01:36:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:36:52,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:52,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:36:52,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:52,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1637577031, now seen corresponding path program 1 times [2025-03-09 01:36:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021905341] [2025-03-09 01:36:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:52,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:52,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:52,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021905341] [2025-03-09 01:36:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021905341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832570238] [2025-03-09 01:36:52,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:52,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:52,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:52,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:52,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:36:52,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:52,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:52,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:52,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:52,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:52,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:52,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832570238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:52,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:36:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416145736] [2025-03-09 01:36:52,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:52,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:36:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:52,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:36:52,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:52,348 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:52,472 INFO L93 Difference]: Finished difference Result 182 states and 244 transitions. [2025-03-09 01:36:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:36:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:36:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:52,474 INFO L225 Difference]: With dead ends: 182 [2025-03-09 01:36:52,475 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 01:36:52,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:52,476 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:52,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 60 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 01:36:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-09 01:36:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 177 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2025-03-09 01:36:52,494 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 9 [2025-03-09 01:36:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:52,495 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2025-03-09 01:36:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2025-03-09 01:36:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:36:52,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:52,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:52,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:52,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:52,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2122043121, now seen corresponding path program 1 times [2025-03-09 01:36:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020744470] [2025-03-09 01:36:52,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:52,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:52,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:52,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020744470] [2025-03-09 01:36:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020744470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551375170] [2025-03-09 01:36:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:52,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:52,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:52,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:52,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:36:52,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:52,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:52,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:52,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:36:52,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:52,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551375170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:52,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 01:36:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239170307] [2025-03-09 01:36:52,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:36:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:36:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:52,898 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:53,254 INFO L93 Difference]: Finished difference Result 338 states and 416 transitions. [2025-03-09 01:36:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:36:53,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:36:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:53,256 INFO L225 Difference]: With dead ends: 338 [2025-03-09 01:36:53,256 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 01:36:53,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:36:53,257 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 565 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:53,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 27 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:36:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 01:36:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2025-03-09 01:36:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 166 states have (on average 1.1566265060240963) internal successors, (192), 173 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2025-03-09 01:36:53,267 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 15 [2025-03-09 01:36:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:53,268 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2025-03-09 01:36:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2025-03-09 01:36:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:36:53,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:53,268 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:36:53,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:53,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:53,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:53,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1209885187, now seen corresponding path program 2 times [2025-03-09 01:36:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:53,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300012068] [2025-03-09 01:36:53,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:53,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:36:53,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:36:53,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:53,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:53,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300012068] [2025-03-09 01:36:53,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300012068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:53,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250206477] [2025-03-09 01:36:53,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:53,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:53,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:53,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:36:53,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:36:53,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:36:53,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:53,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:53,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:53,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:53,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250206477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:53,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:53,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:36:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882826653] [2025-03-09 01:36:53,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:53,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:53,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:53,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:53,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:36:53,616 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-03-09 01:36:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:53,663 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2025-03-09 01:36:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:36:53,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 18 [2025-03-09 01:36:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:53,664 INFO L225 Difference]: With dead ends: 174 [2025-03-09 01:36:53,664 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 01:36:53,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:36:53,665 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 80 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:53,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 58 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 01:36:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2025-03-09 01:36:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.1232876712328768) internal successors, (164), 149 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2025-03-09 01:36:53,682 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 18 [2025-03-09 01:36:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:53,682 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2025-03-09 01:36:53,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-03-09 01:36:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2025-03-09 01:36:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:36:53,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:53,683 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:36:53,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:53,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:53,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 743644539, now seen corresponding path program 1 times [2025-03-09 01:36:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877173548] [2025-03-09 01:36:53,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:53,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:53,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:36:53,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:36:53,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:53,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 01:36:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877173548] [2025-03-09 01:36:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877173548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636049850] [2025-03-09 01:36:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:53,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:53,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:53,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:36:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:36:54,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:36:54,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:54,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:54,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:36:54,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:36:54,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:36:54,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636049850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:54,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:54,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-03-09 01:36:54,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459223395] [2025-03-09 01:36:54,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:54,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:36:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:54,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:36:54,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:36:54,194 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:54,856 INFO L93 Difference]: Finished difference Result 608 states and 717 transitions. [2025-03-09 01:36:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:36:54,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 34 [2025-03-09 01:36:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:54,858 INFO L225 Difference]: With dead ends: 608 [2025-03-09 01:36:54,858 INFO L226 Difference]: Without dead ends: 474 [2025-03-09 01:36:54,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:36:54,860 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1374 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:54,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 43 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:36:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-09 01:36:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2025-03-09 01:36:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 470 states have (on average 1.053191489361702) internal successors, (495), 473 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 495 transitions. [2025-03-09 01:36:54,885 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 495 transitions. Word has length 34 [2025-03-09 01:36:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:54,885 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 495 transitions. [2025-03-09 01:36:54,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 495 transitions. [2025-03-09 01:36:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 01:36:54,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:54,890 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 01:36:54,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:36:55,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:55,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:36:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1518795384, now seen corresponding path program 2 times [2025-03-09 01:36:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727290221] [2025-03-09 01:36:55,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:55,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 01:36:55,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-03-09 01:36:55,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:55,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727290221] [2025-03-09 01:36:55,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727290221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:55,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185814660] [2025-03-09 01:36:55,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:55,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:55,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:55,141 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:55,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:36:55,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 01:36:55,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-03-09 01:36:55,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:55,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:55,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:55,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185814660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:55,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:36:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886544708] [2025-03-09 01:36:55,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:55,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:55,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:36:55,442 INFO L87 Difference]: Start difference. First operand 474 states and 495 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:55,495 INFO L93 Difference]: Finished difference Result 474 states and 495 transitions. [2025-03-09 01:36:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:55,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-09 01:36:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:55,496 INFO L225 Difference]: With dead ends: 474 [2025-03-09 01:36:55,496 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:36:55,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:36:55,497 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:55,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 19 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:36:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:36:55,498 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-03-09 01:36:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:36:55,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-03-09 01:36:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:55,498 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:36:55,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:36:55,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:36:55,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-09 01:36:55,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-09 01:36:55,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:36:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:55,704 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:55,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:36:56,806 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:36:56,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:36:56 BoogieIcfgContainer [2025-03-09 01:36:56,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:36:56,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:36:56,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:36:56,820 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:36:56,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:51" (3/4) ... [2025-03-09 01:36:56,822 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:36:56,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 01:36:56,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:36:56,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:36:56,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:36:56,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:36:56,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:36:56,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:36:56,899 INFO L158 Benchmark]: Toolchain (without parser) took 6357.25ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.6MB in the beginning and 124.0MB in the end (delta: -18.4MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. [2025-03-09 01:36:56,900 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:56,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.86ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:56,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.19ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:56,901 INFO L158 Benchmark]: Boogie Preprocessor took 24.55ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:56,901 INFO L158 Benchmark]: IcfgBuilder took 307.06ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 74.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:36:56,901 INFO L158 Benchmark]: TraceAbstraction took 5758.34ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 74.9MB in the beginning and 130.7MB in the end (delta: -55.9MB). Peak memory consumption was 145.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:56,902 INFO L158 Benchmark]: Witness Printer took 79.06ms. Allocated memory is still 343.9MB. Free memory was 130.7MB in the beginning and 124.0MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:56,904 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.86ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.19ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.55ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.06ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 74.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5758.34ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 74.9MB in the beginning and 130.7MB in the end (delta: -55.9MB). Peak memory consumption was 145.4MB. Max. memory is 16.1GB. * Witness Printer took 79.06ms. Allocated memory is still 343.9MB. Free memory was 130.7MB in the beginning and 124.0MB in the end (delta: 6.8MB). 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: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 57 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 9, TraceHistogramMax: 30, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2290 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2290 mSDsluCounter, 449 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 866 IncrementalHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 490 mSolverCounterUnsat, 215 mSDtfsCounter, 866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 394 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 4 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 2580/4667 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: 67]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) - InvariantResult [Line: 69]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) - InvariantResult [Line: 55]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:36:56,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE