./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:10:27,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:10:27,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:10:27,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:10:27,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:10:27,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:10:27,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:10:27,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:10:27,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:10:27,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:10:27,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:10:27,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:10:27,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:10:27,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:10:27,510 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:10:27,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:10:27,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:10:27,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:10:27,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:10:27,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:10:27,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:10:27,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:10:27,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:10:27,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:10:27,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:10:27,513 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2025-02-08 09:10:27,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:10:27,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:10:27,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:10:27,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:10:27,737 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:10:27,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2025-02-08 09:10:28,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d018b9f8c/9f18f998fb2f4034a9be9effc43f1884/FLAG67da6eb91 [2025-02-08 09:10:29,183 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:10:29,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2025-02-08 09:10:29,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d018b9f8c/9f18f998fb2f4034a9be9effc43f1884/FLAG67da6eb91 [2025-02-08 09:10:29,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d018b9f8c/9f18f998fb2f4034a9be9effc43f1884 [2025-02-08 09:10:29,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:10:29,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:10:29,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:10:29,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:10:29,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:10:29,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29, skipping insertion in model container [2025-02-08 09:10:29,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:10:29,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:10:29,663 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:10:29,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:10:29,715 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:10:29,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29 WrapperNode [2025-02-08 09:10:29,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:10:29,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:10:29,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:10:29,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:10:29,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,741 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2025-02-08 09:10:29,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:10:29,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:10:29,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:10:29,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:10:29,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,762 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-02-08 09:10:29,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:10:29,772 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:10:29,772 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:10:29,772 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:10:29,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (1/1) ... [2025-02-08 09:10:29,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:10:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:29,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:10:29,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 09:10:29,814 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 09:10:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 09:10:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:10:29,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:10:29,906 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:10:29,907 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:10:30,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 09:10:30,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 09:10:30,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 09:10:30,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false;assume false; [2025-02-08 09:10:30,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 09:10:30,098 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 09:10:30,119 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-08 09:10:30,120 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:10:30,126 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:10:30,127 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:10:30,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:30 BoogieIcfgContainer [2025-02-08 09:10:30,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:10:30,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:10:30,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:10:30,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:10:30,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:10:29" (1/3) ... [2025-02-08 09:10:30,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae2fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:10:30, skipping insertion in model container [2025-02-08 09:10:30,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:29" (2/3) ... [2025-02-08 09:10:30,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae2fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:10:30, skipping insertion in model container [2025-02-08 09:10:30,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:30" (3/3) ... [2025-02-08 09:10:30,137 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2025-02-08 09:10:30,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:10:30,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_remove_all_reverse.i that has 2 procedures, 34 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2025-02-08 09:10:30,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:10:30,210 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;@2051c2c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:10:30,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 09:10:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 09:10:30,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:30,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:30,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash -718201546, now seen corresponding path program 1 times [2025-02-08 09:10:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878699227] [2025-02-08 09:10:30,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:30,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 09:10:30,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 09:10:30,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:30,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:30,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878699227] [2025-02-08 09:10:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878699227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:10:30,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44848064] [2025-02-08 09:10:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 09:10:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:30,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 09:10:30,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:10:30,440 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:10:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:30,454 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-02-08 09:10:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 09:10:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 09:10:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:30,462 INFO L225 Difference]: With dead ends: 52 [2025-02-08 09:10:30,462 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 09:10:30,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:10:30,468 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:30,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 09:10:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 09:10:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-02-08 09:10:30,500 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2025-02-08 09:10:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:30,501 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-02-08 09:10:30,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:10:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-02-08 09:10:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 09:10:30,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:30,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:30,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:10:30,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash -815000906, now seen corresponding path program 1 times [2025-02-08 09:10:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509740057] [2025-02-08 09:10:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:30,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 09:10:30,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 09:10:30,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:30,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:30,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:30,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509740057] [2025-02-08 09:10:30,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509740057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:30,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:30,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001586961] [2025-02-08 09:10:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:30,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:10:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:30,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:10:30,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:10:30,711 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:10:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:30,727 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2025-02-08 09:10:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:10:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-08 09:10:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:30,729 INFO L225 Difference]: With dead ends: 44 [2025-02-08 09:10:30,729 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 09:10:30,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:10:30,730 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:30,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 09:10:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-08 09:10:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-08 09:10:30,737 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2025-02-08 09:10:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:30,738 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 09:10:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:10:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-08 09:10:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 09:10:30,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:30,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:10:30,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:30,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1870035613, now seen corresponding path program 1 times [2025-02-08 09:10:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:30,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942844572] [2025-02-08 09:10:30,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:10:30,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:10:30,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:30,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 09:10:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942844572] [2025-02-08 09:10:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942844572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928144065] [2025-02-08 09:10:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:30,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:10:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:30,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:10:30,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:30,838 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:30,856 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-02-08 09:10:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:10:30,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-02-08 09:10:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:30,857 INFO L225 Difference]: With dead ends: 35 [2025-02-08 09:10:30,857 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 09:10:30,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:30,858 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:30,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 09:10:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 09:10:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:10:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-02-08 09:10:30,861 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2025-02-08 09:10:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:30,862 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-02-08 09:10:30,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-02-08 09:10:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 09:10:30,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:30,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:30,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:10:30,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 613656150, now seen corresponding path program 1 times [2025-02-08 09:10:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-02-08 09:10:30,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:30,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 09:10:30,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 09:10:30,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:30,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-02-08 09:10:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447792565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807508738] [2025-02-08 09:10:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:10:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:30,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:10:30,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:30,941 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:30,959 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-02-08 09:10:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:10:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-08 09:10:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:30,959 INFO L225 Difference]: With dead ends: 46 [2025-02-08 09:10:30,959 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 09:10:30,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:30,960 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:30,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 09:10:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 09:10:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:10:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-02-08 09:10:30,970 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2025-02-08 09:10:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:30,970 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-02-08 09:10:30,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-02-08 09:10:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 09:10:30,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:30,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:10:30,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -531339837, now seen corresponding path program 1 times [2025-02-08 09:10:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-02-08 09:10:30,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 09:10:30,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 09:10:30,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:30,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 09:10:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-02-08 09:10:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36089725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148396904] [2025-02-08 09:10:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:31,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:31,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:31,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:10:31,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 09:10:31,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 09:10:31,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:31,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:31,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:10:31,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 09:10:31,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:10:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148396904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:10:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:10:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340638096] [2025-02-08 09:10:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:10:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:31,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:10:31,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:10:31,328 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:10:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:31,358 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-02-08 09:10:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:10:31,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-08 09:10:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:31,360 INFO L225 Difference]: With dead ends: 74 [2025-02-08 09:10:31,360 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 09:10:31,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:10:31,361 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:31,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 09:10:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 09:10:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-02-08 09:10:31,366 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 27 [2025-02-08 09:10:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:31,366 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-02-08 09:10:31,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:10:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-02-08 09:10:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 09:10:31,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:31,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:31,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 09:10:31,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:31,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:31,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1608329090, now seen corresponding path program 1 times [2025-02-08 09:10:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-02-08 09:10:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:31,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 09:10:31,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 09:10:31,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:31,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-02-08 09:10:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365254704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612439999] [2025-02-08 09:10:31,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:31,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:31,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:10:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 09:10:31,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 09:10:31,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:31,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:31,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:10:31,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:31,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:10:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612439999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:10:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:10:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145921438] [2025-02-08 09:10:31,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:10:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:31,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:10:31,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:31,864 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:31,921 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-02-08 09:10:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:10:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-08 09:10:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:31,922 INFO L225 Difference]: With dead ends: 38 [2025-02-08 09:10:31,923 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 09:10:31,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:31,923 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:31,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 09:10:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 09:10:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-02-08 09:10:31,927 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 34 [2025-02-08 09:10:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:31,927 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-02-08 09:10:31,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-02-08 09:10:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 09:10:31,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:31,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:31,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:10:32,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:32,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1681405746, now seen corresponding path program 1 times [2025-02-08 09:10:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937719815] [2025-02-08 09:10:32,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 09:10:32,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 09:10:32,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:32,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:32,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937719815] [2025-02-08 09:10:32,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937719815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:32,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277083518] [2025-02-08 09:10:32,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:32,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:32,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:32,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:10:32,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 09:10:32,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 09:10:32,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:32,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:32,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:10:32,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:32,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:10:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:32,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277083518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:10:32,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:10:32,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 09:10:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521774921] [2025-02-08 09:10:32,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:10:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:10:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:32,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:10:32,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:10:32,475 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:32,533 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2025-02-08 09:10:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:10:32,534 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-08 09:10:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:32,538 INFO L225 Difference]: With dead ends: 71 [2025-02-08 09:10:32,538 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 09:10:32,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:10:32,539 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:32,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 190 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 09:10:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-08 09:10:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-02-08 09:10:32,548 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 35 [2025-02-08 09:10:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:32,548 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-02-08 09:10:32,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-02-08 09:10:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 09:10:32,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:32,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:32,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 09:10:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:32,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1977835450, now seen corresponding path program 2 times [2025-02-08 09:10:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-02-08 09:10:32,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:10:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:32,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-08 09:10:32,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 59 statements. [2025-02-08 09:10:32,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:10:32,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 09:10:32,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:32,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-02-08 09:10:32,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700445529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:32,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894862053] [2025-02-08 09:10:32,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:10:32,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:32,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:32,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:32,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:10:32,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-08 09:10:32,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 59 statements. [2025-02-08 09:10:32,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:10:32,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:32,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:10:32,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 09:10:32,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:10:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 09:10:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894862053] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:10:33,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:10:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 09:10:33,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095355847] [2025-02-08 09:10:33,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:10:33,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:10:33,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:33,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:10:33,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:10:33,075 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 09:10:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:33,107 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-02-08 09:10:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:10:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2025-02-08 09:10:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:33,108 INFO L225 Difference]: With dead ends: 70 [2025-02-08 09:10:33,108 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:10:33,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:10:33,109 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:33,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:10:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:10:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:10:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:10:33,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2025-02-08 09:10:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:10:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 09:10:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:10:33,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:10:33,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 09:10:33,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 09:10:33,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 09:10:33,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 09:10:33,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 09:10:33,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 09:10:33,320 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:33,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:10:33,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:10:33,386 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-02-08 09:10:33,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-02-08 09:10:33,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:10:33 BoogieIcfgContainer [2025-02-08 09:10:33,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:10:33,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:10:33,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:10:33,393 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:10:33,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:30" (3/4) ... [2025-02-08 09:10:33,395 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:10:33,399 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure node_create [2025-02-08 09:10:33,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 09:10:33,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 09:10:33,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:10:33,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:10:33,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:10:33,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:10:33,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:10:33,459 INFO L158 Benchmark]: Toolchain (without parser) took 3997.17ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 64.6MB in the end (delta: 47.2MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-02-08 09:10:33,459 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:10:33,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.74ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 94.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:10:33,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.80ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:10:33,460 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:10:33,460 INFO L158 Benchmark]: IcfgBuilder took 355.93ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 73.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:10:33,460 INFO L158 Benchmark]: TraceAbstraction took 3262.93ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 70.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:10:33,460 INFO L158 Benchmark]: Witness Printer took 65.79ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 64.6MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:10:33,461 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.31ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.74ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 94.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.80ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 355.93ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 73.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3262.93ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 70.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.79ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 64.6MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 * 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: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: 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 2 procedures, 34 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 758 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 240 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 384 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 972 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 259/375 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 4 specifications checked. All of them hold - InvariantResult [Line: 617]: Location Invariant Derived location invariant: (((i == 0) && (len == 2)) || (((1 <= i) && (i <= 2147483646)) && (len == 2))) - InvariantResult [Line: 586]: Location Invariant Derived location invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:10:33,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE