./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/diff-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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-3-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 ae698f02be6e3657db0e7ca3e62c4cfb121d43a876624ed4d21d19b033e0c02e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:39:45,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:39:45,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:39:45,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:39:45,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:39:45,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:39:45,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:39:45,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:39:45,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:39:45,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:39:45,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:39:45,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:39:45,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:39:45,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:39:45,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:39:45,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:45,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:39:45,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:39:45,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:39:45,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:39:45,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:39:45,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:39:45,573 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 -> ae698f02be6e3657db0e7ca3e62c4cfb121d43a876624ed4d21d19b033e0c02e [2025-03-17 14:39:45,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:39:45,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:39:45,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:39:45,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:39:45,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:39:45,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/diff-3-n-u.c [2025-03-17 14:39:46,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369a4ea49/de8ee9a6fb904f64ae18538397f95248/FLAG634bc152d [2025-03-17 14:39:47,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:39:47,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/diff-3-n-u.c [2025-03-17 14:39:47,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369a4ea49/de8ee9a6fb904f64ae18538397f95248/FLAG634bc152d [2025-03-17 14:39:47,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369a4ea49/de8ee9a6fb904f64ae18538397f95248 [2025-03-17 14:39:47,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:39:47,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:39:47,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:47,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:39:47,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:39:47,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47, skipping insertion in model container [2025-03-17 14:39:47,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:39:47,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:47,684 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:39:47,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:47,717 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:39:47,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47 WrapperNode [2025-03-17 14:39:47,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:47,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:47,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:39:47,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:39:47,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,748 INFO L138 Inliner]: procedures = 14, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-03-17 14:39:47,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:47,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:39:47,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:39:47,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:39:47,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,763 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 3, 2, 3]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-03-17 14:39:47,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:39:47,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:39:47,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:39:47,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:39:47,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (1/1) ... [2025-03-17 14:39:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:47,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:47,798 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-17 14:39:47,800 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-17 14:39:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:39:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:39:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:39:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 14:39:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:39:47,876 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:39:47,878 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:39:48,084 INFO L1322 $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-17 14:39:48,098 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-17 14:39:48,099 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:39:48,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:39:48,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:39:48,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:48 BoogieIcfgContainer [2025-03-17 14:39:48,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:39:48,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:39:48,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:39:48,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:39:48,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:39:47" (1/3) ... [2025-03-17 14:39:48,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282107f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:48, skipping insertion in model container [2025-03-17 14:39:48,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:47" (2/3) ... [2025-03-17 14:39:48,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282107f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:48, skipping insertion in model container [2025-03-17 14:39:48,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:48" (3/3) ... [2025-03-17 14:39:48,121 INFO L128 eAbstractionObserver]: Analyzing ICFG diff-3-n-u.c [2025-03-17 14:39:48,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:39:48,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diff-3-n-u.c that has 1 procedures, 51 locations, 1 initial locations, 9 loop locations, and 18 error locations. [2025-03-17 14:39:48,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:39:48,181 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;@3fecc276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:39:48,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:39:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.875) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:39:48,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:48,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:39:48,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:48,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2769524, now seen corresponding path program 1 times [2025-03-17 14:39:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220938231] [2025-03-17 14:39:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:48,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:39:48,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:39:48,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:48,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:48,367 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-17 14:39:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:48,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220938231] [2025-03-17 14:39:48,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220938231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:48,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772007673] [2025-03-17 14:39:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:48,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:48,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:48,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:48,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:48,391 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.875) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-17 14:39:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:48,491 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2025-03-17 14:39:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-17 14:39:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:48,499 INFO L225 Difference]: With dead ends: 127 [2025-03-17 14:39:48,499 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 14:39:48,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:48,505 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:48,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 78 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 14:39:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-17 14:39:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.7) internal successors, (85), 67 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-17 14:39:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-17 14:39:48,538 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 4 [2025-03-17 14:39:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:48,538 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-17 14:39:48,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-17 14:39:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-17 14:39:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:39:48,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:48,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:39:48,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:39:48,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 85854616, now seen corresponding path program 1 times [2025-03-17 14:39:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604195305] [2025-03-17 14:39:48,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:48,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:39:48,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:39:48,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:48,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:48,618 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-17 14:39:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604195305] [2025-03-17 14:39:48,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604195305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:48,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:39:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817632517] [2025-03-17 14:39:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:48,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:48,621 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. 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-17 14:39:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:48,681 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2025-03-17 14:39:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:48,681 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-17 14:39:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:48,684 INFO L225 Difference]: With dead ends: 96 [2025-03-17 14:39:48,684 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 14:39:48,684 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-17 14:39:48,685 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:48,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 14:39:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 14:39:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 89 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-17 14:39:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-03-17 14:39:48,694 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 5 [2025-03-17 14:39:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:48,694 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-03-17 14:39:48,694 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-17 14:39:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-03-17 14:39:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:39:48,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:48,695 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:48,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:39:48,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:48,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2105622181, now seen corresponding path program 1 times [2025-03-17 14:39:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296928748] [2025-03-17 14:39:48,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:48,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:39:48,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:39:48,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:48,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:48,801 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-17 14:39:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:48,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296928748] [2025-03-17 14:39:48,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296928748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:48,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235593648] [2025-03-17 14:39:48,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:48,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:48,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:48,805 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-17 14:39:48,807 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-17 14:39:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:39:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:39:48,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:48,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:48,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:48,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:48,898 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-17 14:39:48,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235593648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:48,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 14:39:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502096608] [2025-03-17 14:39:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:48,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:48,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:48,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:39:48,901 INFO L87 Difference]: Start difference. First operand 90 states and 113 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-17 14:39:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:48,969 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2025-03-17 14:39:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:48,970 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-17 14:39:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:48,970 INFO L225 Difference]: With dead ends: 90 [2025-03-17 14:39:48,971 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 14:39:48,972 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-17 14:39:48,972 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:48,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 14:39:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 14:39:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 86 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-17 14:39:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2025-03-17 14:39:48,987 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 8 [2025-03-17 14:39:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:48,988 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2025-03-17 14:39:48,988 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-17 14:39:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2025-03-17 14:39:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:39:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:48,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:49,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:49,191 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-17 14:39:49,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2104821583, now seen corresponding path program 1 times [2025-03-17 14:39:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071575139] [2025-03-17 14:39:49,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:39:49,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:39:49,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:49,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071575139] [2025-03-17 14:39:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071575139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:49,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483218784] [2025-03-17 14:39:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:49,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:49,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:49,254 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 4 states, 4 states have (on average 2.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-17 14:39:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:49,292 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2025-03-17 14:39:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.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-17 14:39:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:49,294 INFO L225 Difference]: With dead ends: 173 [2025-03-17 14:39:49,294 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 14:39:49,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:49,295 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:49,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 75 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 14:39:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 14:39:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2025-03-17 14:39:49,302 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 8 [2025-03-17 14:39:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:49,302 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2025-03-17 14:39:49,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.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-17 14:39:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2025-03-17 14:39:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:39:49,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:49,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:39:49,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:39:49,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:49,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash -849778150, now seen corresponding path program 1 times [2025-03-17 14:39:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:49,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396638896] [2025-03-17 14:39:49,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:49,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:39:49,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:39:49,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:49,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:49,354 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-17 14:39:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396638896] [2025-03-17 14:39:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396638896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848746356] [2025-03-17 14:39:49,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:49,358 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-17 14:39:49,359 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-17 14:39:49,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:39:49,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:39:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:49,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:49,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:49,435 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-17 14:39:49,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:49,458 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-17 14:39:49,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848746356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:49,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:49,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:39:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827814858] [2025-03-17 14:39:49,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:49,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:39:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:49,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:39:49,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:39:49,461 INFO L87 Difference]: Start difference. First operand 87 states and 101 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-17 14:39:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:49,559 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2025-03-17 14:39:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:39:49,559 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-17 14:39:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:49,562 INFO L225 Difference]: With dead ends: 156 [2025-03-17 14:39:49,563 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 14:39:49,563 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-17 14:39:49,563 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 14:39:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-17 14:39:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-17 14:39:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 185 transitions. [2025-03-17 14:39:49,574 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 185 transitions. Word has length 9 [2025-03-17 14:39:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:49,574 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 185 transitions. [2025-03-17 14:39:49,574 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-17 14:39:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2025-03-17 14:39:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:39:49,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:49,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:49,581 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-17 14:39:49,779 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-17 14:39:49,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:49,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:49,779 INFO L85 PathProgramCache]: Analyzing trace with hash -592214514, now seen corresponding path program 1 times [2025-03-17 14:39:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008873610] [2025-03-17 14:39:49,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:49,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:39:49,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:39:49,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:49,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:39:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008873610] [2025-03-17 14:39:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008873610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:49,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:39:49,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627037862] [2025-03-17 14:39:49,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:49,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:49,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:49,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:49,814 INFO L87 Difference]: Start difference. First operand 153 states and 185 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:49,863 INFO L93 Difference]: Finished difference Result 305 states and 369 transitions. [2025-03-17 14:39:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:49,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:39:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:49,864 INFO L225 Difference]: With dead ends: 305 [2025-03-17 14:39:49,864 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 14:39:49,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:39:49,865 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:49,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 14:39:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 290. [2025-03-17 14:39:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 275 states have (on average 1.32) internal successors, (363), 289 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-17 14:39:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 363 transitions. [2025-03-17 14:39:49,911 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 363 transitions. Word has length 11 [2025-03-17 14:39:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:49,911 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 363 transitions. [2025-03-17 14:39:49,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 363 transitions. [2025-03-17 14:39:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:39:49,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:49,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:39:49,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:39:49,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1423398896, now seen corresponding path program 1 times [2025-03-17 14:39:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223084743] [2025-03-17 14:39:49,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:39:49,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:39:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:49,957 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-17 14:39:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223084743] [2025-03-17 14:39:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223084743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304656463] [2025-03-17 14:39:49,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:49,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:49,961 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-17 14:39:49,962 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-17 14:39:49,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:39:50,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:39:50,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:50,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:50,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:39:50,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:50,039 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-17 14:39:50,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:50,070 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-17 14:39:50,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304656463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:50,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:50,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-03-17 14:39:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041930900] [2025-03-17 14:39:50,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:50,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:39:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:50,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:39:50,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:50,071 INFO L87 Difference]: Start difference. First operand 290 states and 363 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:50,381 INFO L93 Difference]: Finished difference Result 562 states and 702 transitions. [2025-03-17 14:39:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:39:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:39:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:50,383 INFO L225 Difference]: With dead ends: 562 [2025-03-17 14:39:50,383 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 14:39:50,383 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-17 14:39:50,384 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 317 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:50,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 102 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:39:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 14:39:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2025-03-17 14:39:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.1672727272727272) internal successors, (321), 286 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-17 14:39:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 321 transitions. [2025-03-17 14:39:50,404 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 321 transitions. Word has length 15 [2025-03-17 14:39:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:50,405 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 321 transitions. [2025-03-17 14:39:50,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 321 transitions. [2025-03-17 14:39:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:39:50,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:50,407 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-17 14:39:50,414 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-17 14:39:50,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:50,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:50,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1311293635, now seen corresponding path program 2 times [2025-03-17 14:39:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982419115] [2025-03-17 14:39:50,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:50,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:39:50,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 14:39:50,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:50,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:50,649 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-17 14:39:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982419115] [2025-03-17 14:39:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982419115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873650945] [2025-03-17 14:39:50,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:50,652 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-17 14:39:50,653 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-17 14:39:50,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:39:50,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 14:39:50,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:50,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:50,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:50,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:50,740 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-17 14:39:50,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:50,777 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-17 14:39:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873650945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:50,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:39:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971488786] [2025-03-17 14:39:50,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:50,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:50,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:50,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:50,778 INFO L87 Difference]: Start difference. First operand 287 states and 321 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:50,841 INFO L93 Difference]: Finished difference Result 287 states and 321 transitions. [2025-03-17 14:39:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:39:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:39:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:50,843 INFO L225 Difference]: With dead ends: 287 [2025-03-17 14:39:50,843 INFO L226 Difference]: Without dead ends: 284 [2025-03-17 14:39:50,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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-17 14:39:50,844 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:50,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-17 14:39:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2025-03-17 14:39:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 243 states have (on average 1.139917695473251) internal successors, (277), 251 states have internal predecessors, (277), 0 states have call successors, (0), 0 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-17 14:39:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2025-03-17 14:39:50,856 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 18 [2025-03-17 14:39:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:50,856 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2025-03-17 14:39:50,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2025-03-17 14:39:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:39:50,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:50,857 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:39:50,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:39:51,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:51,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1931845701, now seen corresponding path program 1 times [2025-03-17 14:39:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513413139] [2025-03-17 14:39:51,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:51,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:39:51,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:39:51,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:51,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:51,124 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-17 14:39:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513413139] [2025-03-17 14:39:51,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513413139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108349759] [2025-03-17 14:39:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:51,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:51,127 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-17 14:39:51,129 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-17 14:39:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:39:51,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:39:51,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:51,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:51,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:39:51,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:51,277 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-17 14:39:51,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:51,352 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-17 14:39:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108349759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:51,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:51,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 16 [2025-03-17 14:39:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352525332] [2025-03-17 14:39:51,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:51,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:39:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:51,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:39:51,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:39:51,354 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:51,989 INFO L93 Difference]: Finished difference Result 996 states and 1170 transitions. [2025-03-17 14:39:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 14:39:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 14:39:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:51,993 INFO L225 Difference]: With dead ends: 996 [2025-03-17 14:39:51,993 INFO L226 Difference]: Without dead ends: 760 [2025-03-17 14:39:51,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 14:39:51,997 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 781 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:51,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 160 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:39:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-17 14:39:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2025-03-17 14:39:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 751 states have (on average 1.0612516644474035) internal successors, (797), 759 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-17 14:39:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 797 transitions. [2025-03-17 14:39:52,028 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 797 transitions. Word has length 34 [2025-03-17 14:39:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:52,028 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 797 transitions. [2025-03-17 14:39:52,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 797 transitions. [2025-03-17 14:39:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 14:39:52,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:52,031 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:39:52,037 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-17 14:39:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:52,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:52,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2098867281, now seen corresponding path program 1 times [2025-03-17 14:39:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625902517] [2025-03-17 14:39:52,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:52,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 14:39:52,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 14:39:52,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:52,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-17 14:39:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625902517] [2025-03-17 14:39:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625902517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943777821] [2025-03-17 14:39:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:52,387 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-17 14:39:52,389 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-17 14:39:52,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 14:39:52,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 14:39:52,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:52,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:39:52,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 14:39:52,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 14:39:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943777821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:52,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 13, 13] total 27 [2025-03-17 14:39:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018847735] [2025-03-17 14:39:52,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:52,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:39:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:52,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:39:52,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:39:52,943 INFO L87 Difference]: Start difference. First operand 760 states and 797 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:54,494 INFO L93 Difference]: Finished difference Result 2278 states and 2566 transitions. [2025-03-17 14:39:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 14:39:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-17 14:39:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:54,501 INFO L225 Difference]: With dead ends: 2278 [2025-03-17 14:39:54,501 INFO L226 Difference]: Without dead ends: 1552 [2025-03-17 14:39:54,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 14:39:54,504 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1534 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:54,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 201 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 14:39:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-17 14:39:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1549. [2025-03-17 14:39:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1543 states have (on average 1.0278677900194426) internal successors, (1586), 1548 states have internal predecessors, (1586), 0 states have call successors, (0), 0 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-17 14:39:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1586 transitions. [2025-03-17 14:39:54,559 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1586 transitions. Word has length 76 [2025-03-17 14:39:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 1586 transitions. [2025-03-17 14:39:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1586 transitions. [2025-03-17 14:39:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 14:39:54,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:54,562 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 14:39:54,570 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-17 14:39:54,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:54,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:54,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1564927140, now seen corresponding path program 1 times [2025-03-17 14:39:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632479988] [2025-03-17 14:39:54,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:54,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 14:39:54,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 14:39:54,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 0 proven. 1506 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2025-03-17 14:39:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632479988] [2025-03-17 14:39:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632479988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966472860] [2025-03-17 14:39:54,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:54,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:54,996 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:54,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:39:55,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 14:39:55,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 14:39:55,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:55,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:55,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:39:55,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 14:39:55,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 14:39:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966472860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:56,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 25, 25] total 51 [2025-03-17 14:39:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501049075] [2025-03-17 14:39:56,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 14:39:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:56,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 14:39:56,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 14:39:56,114 INFO L87 Difference]: Start difference. First operand 1549 states and 1586 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-17 14:40:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:00,787 INFO L93 Difference]: Finished difference Result 6181 states and 6918 transitions. [2025-03-17 14:40:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-17 14:40:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 0 states have call successors, (0), 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 149 [2025-03-17 14:40:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:00,802 INFO L225 Difference]: With dead ends: 6181 [2025-03-17 14:40:00,802 INFO L226 Difference]: Without dead ends: 4702 [2025-03-17 14:40:00,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2025-03-17 14:40:00,810 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4035 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 964 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4035 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 964 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:00,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4035 Valid, 205 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [964 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 14:40:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2025-03-17 14:40:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4696. [2025-03-17 14:40:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4690 states have (on average 1.0134328358208955) internal successors, (4753), 4695 states have internal predecessors, (4753), 0 states have call successors, (0), 0 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-17 14:40:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 4753 transitions. [2025-03-17 14:40:00,966 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 4753 transitions. Word has length 149 [2025-03-17 14:40:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:00,966 INFO L471 AbstractCegarLoop]: Abstraction has 4696 states and 4753 transitions. [2025-03-17 14:40:00,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-17 14:40:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 4753 transitions. [2025-03-17 14:40:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-17 14:40:00,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:00,973 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1] [2025-03-17 14:40:00,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:40:01,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:01,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:40:01,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1137441320, now seen corresponding path program 2 times [2025-03-17 14:40:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:01,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219740427] [2025-03-17 14:40:01,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:01,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 2 equivalence classes. [2025-03-17 14:40:01,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 428 statements. [2025-03-17 14:40:01,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-17 14:40:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219740427] [2025-03-17 14:40:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219740427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759875245] [2025-03-17 14:40:01,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:01,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:01,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:01,298 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:40:01,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:40:01,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 2 equivalence classes. [2025-03-17 14:40:01,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 428 statements. [2025-03-17 14:40:01,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:01,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:40:01,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-17 14:40:01,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-17 14:40:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759875245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:02,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:02,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:40:02,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208254869] [2025-03-17 14:40:02,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:02,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:40:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:02,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:40:02,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:40:02,216 INFO L87 Difference]: Start difference. First operand 4696 states and 4753 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:40:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:02,336 INFO L93 Difference]: Finished difference Result 4696 states and 4753 transitions. [2025-03-17 14:40:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:40:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2025-03-17 14:40:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:02,349 INFO L225 Difference]: With dead ends: 4696 [2025-03-17 14:40:02,349 INFO L226 Difference]: Without dead ends: 4693 [2025-03-17 14:40:02,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 852 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-17 14:40:02,352 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:02,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2025-03-17 14:40:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 1594. [2025-03-17 14:40:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1591 states have (on average 1.0169704588309239) internal successors, (1618), 1593 states have internal predecessors, (1618), 0 states have call successors, (0), 0 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-17 14:40:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1618 transitions. [2025-03-17 14:40:02,424 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1618 transitions. Word has length 428 [2025-03-17 14:40:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:02,425 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 1618 transitions. [2025-03-17 14:40:02,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:40:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1618 transitions. [2025-03-17 14:40:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-17 14:40:02,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:02,431 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2025-03-17 14:40:02,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:40:02,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:40:02,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:40:02,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 831848796, now seen corresponding path program 2 times [2025-03-17 14:40:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392087098] [2025-03-17 14:40:02,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:02,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 439 statements into 2 equivalence classes. [2025-03-17 14:40:02,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 439 statements. [2025-03-17 14:40:02,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:02,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-17 14:40:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:02,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392087098] [2025-03-17 14:40:02,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392087098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:02,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572024897] [2025-03-17 14:40:02,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:02,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:02,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:40:02,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:40:03,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 439 statements into 2 equivalence classes. [2025-03-17 14:40:03,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 439 statements. [2025-03-17 14:40:03,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:03,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:40:03,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-17 14:40:03,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-17 14:40:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572024897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:03,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:40:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56150919] [2025-03-17 14:40:03,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:03,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:40:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:03,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:40:03,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:40:03,729 INFO L87 Difference]: Start difference. First operand 1594 states and 1618 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-17 14:40:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:03,837 INFO L93 Difference]: Finished difference Result 1594 states and 1618 transitions. [2025-03-17 14:40:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:40:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 439 [2025-03-17 14:40:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:03,839 INFO L225 Difference]: With dead ends: 1594 [2025-03-17 14:40:03,839 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:40:03,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 874 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-17 14:40:03,842 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:03,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:40:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:40:03,843 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-17 14:40:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:40:03,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2025-03-17 14:40:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:03,844 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:40:03,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-17 14:40:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:40:03,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:40:03,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-17 14:40:03,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-17 14:40:03,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-17 14:40:03,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-17 14:40:03,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-17 14:40:03,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-17 14:40:03,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-17 14:40:03,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:40:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:40:04,053 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:04,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:40:15,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:40:15,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:40:15 BoogieIcfgContainer [2025-03-17 14:40:15,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:40:15,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:40:15,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:40:15,358 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:40:15,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:48" (3/4) ... [2025-03-17 14:40:15,360 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:40:15,371 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 14:40:15,371 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:40:15,371 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:40:15,371 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:40:15,434 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:40:15,434 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:40:15,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:40:15,435 INFO L158 Benchmark]: Toolchain (without parser) took 27876.98ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 107.9MB in the beginning and 519.7MB in the end (delta: -411.8MB). Peak memory consumption was 262.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:15,435 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:15,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.13ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 96.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:15,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.64ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:15,436 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:15,436 INFO L158 Benchmark]: IcfgBuilder took 341.55ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 76.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:40:15,436 INFO L158 Benchmark]: TraceAbstraction took 27242.46ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 75.9MB in the beginning and 528.1MB in the end (delta: -452.2MB). Peak memory consumption was 454.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:15,436 INFO L158 Benchmark]: Witness Printer took 76.56ms. Allocated memory is still 822.1MB. Free memory was 528.1MB in the beginning and 519.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:15,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.13ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 96.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.64ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 341.55ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 76.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27242.46ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 75.9MB in the beginning and 528.1MB in the end (delta: -452.2MB). Peak memory consumption was 454.4MB. Max. memory is 16.1GB. * Witness Printer took 76.56ms. Allocated memory is still 822.1MB. Free memory was 528.1MB in the beginning and 519.7MB in the end (delta: 8.4MB). There was no memory consumed. 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: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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, 51 locations, 60 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 138, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7148 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7148 mSDsluCounter, 1288 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 1614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1839 IncrementalHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1614 mSolverCounterUnsat, 435 mSDtfsCounter, 1839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2564 GetRequests, 2234 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4696occurred in iteration=11, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 3158 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3518 ConstructedInterpolants, 0 QuantifiedInterpolants, 10618 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1752 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 102842/183898 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 18 specifications checked. All of them hold - InvariantResult [Line: 51]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 71]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 33]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 73]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 31]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 68]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 48]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:40:15,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE