./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/recursified_loop-simple/recursified_nested_1b.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff'] 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/recursified_loop-simple/recursified_nested_1b.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:56:03,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:56:03,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:56:03,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:56:03,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:56:03,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:56:03,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:56:03,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:56:03,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:56:03,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:56:03,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:56:03,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:56:03,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:56:03,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:56:03,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:56:03,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:56:03,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:56:03,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:56:03,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:56:03,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:56:03,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:56:03,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:56:03,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:56:03,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:56:03,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:56:03,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:56:03,980 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 -> 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff [2024-11-07 20:56:04,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:56:04,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:56:04,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:56:04,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:56:04,205 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:56:04,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2024-11-07 20:56:05,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:56:05,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:56:05,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2024-11-07 20:56:05,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a61966318/2cd3f636d4a2499bb481ede93452bdba/FLAGf3b4ce831 [2024-11-07 20:56:05,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a61966318/2cd3f636d4a2499bb481ede93452bdba [2024-11-07 20:56:05,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:56:05,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:56:05,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:56:05,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:56:05,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:56:05,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:56:05" (1/1) ... [2024-11-07 20:56:05,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff53e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:05, skipping insertion in model container [2024-11-07 20:56:05,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:56:05" (1/1) ... [2024-11-07 20:56:05,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:56:06,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:56:06,011 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:56:06,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:56:06,027 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:56:06,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06 WrapperNode [2024-11-07 20:56:06,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:56:06,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:56:06,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:56:06,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:56:06,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,043 INFO L138 Inliner]: procedures = 12, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2024-11-07 20:56:06,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:56:06,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:56:06,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:56:06,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:56:06,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,056 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-11-07 20:56:06,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:56:06,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:56:06,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:56:06,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:56:06,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (1/1) ... [2024-11-07 20:56:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:56:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:56:06,084 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) [2024-11-07 20:56:06,086 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 [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2024-11-07 20:56:06,100 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:56:06,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 20:56:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:56:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 20:56:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 20:56:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 20:56:06,146 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:56:06,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:56:06,203 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-07 20:56:06,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:56:06,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:56:06,209 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 20:56:06,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:06 BoogieIcfgContainer [2024-11-07 20:56:06,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:56:06,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:56:06,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:56:06,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:56:06,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:56:05" (1/3) ... [2024-11-07 20:56:06,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0fc781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:56:06, skipping insertion in model container [2024-11-07 20:56:06,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:06" (2/3) ... [2024-11-07 20:56:06,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0fc781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:56:06, skipping insertion in model container [2024-11-07 20:56:06,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:06" (3/3) ... [2024-11-07 20:56:06,217 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_1b.c [2024-11-07 20:56:06,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:56:06,226 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 20:56:06,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:56:06,266 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;@75eeb18f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:56:06,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 20:56:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 16 states have internal predecessors, (17), 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) [2024-11-07 20:56:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 20:56:06,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:56:06,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 20:56:06,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:56:06,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:56:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1274488868, now seen corresponding path program 1 times [2024-11-07 20:56:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:56:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502077564] [2024-11-07 20:56:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:56:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:56:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:56:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:56:06,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:56:06,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502077564] [2024-11-07 20:56:06,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502077564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:56:06,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:56:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:56:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611290487] [2024-11-07 20:56:06,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:56:06,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:56:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:56:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:56:06,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:56:06,592 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 16 states have internal predecessors, (17), 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 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:56:06,680 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-07 20:56:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:56:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 20:56:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:56:06,685 INFO L225 Difference]: With dead ends: 33 [2024-11-07 20:56:06,685 INFO L226 Difference]: Without dead ends: 15 [2024-11-07 20:56:06,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:56:06,691 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:56:06,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:56:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-07 20:56:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-11-07 20:56:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-07 20:56:06,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2024-11-07 20:56:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:56:06,715 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-07 20:56:06,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-07 20:56:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 20:56:06,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:56:06,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:56:06,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:56:06,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:56:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:56:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 854449281, now seen corresponding path program 1 times [2024-11-07 20:56:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:56:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68278022] [2024-11-07 20:56:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:56:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:56:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:56:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:56:06,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:56:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68278022] [2024-11-07 20:56:06,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68278022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:56:06,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:56:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:56:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911896936] [2024-11-07 20:56:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:56:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:56:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:56:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:56:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:56:06,854 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:56:06,907 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-07 20:56:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:56:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 20:56:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:56:06,908 INFO L225 Difference]: With dead ends: 15 [2024-11-07 20:56:06,909 INFO L226 Difference]: Without dead ends: 14 [2024-11-07 20:56:06,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:56:06,910 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:56:06,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:56:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-07 20:56:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-07 20:56:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-07 20:56:06,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-11-07 20:56:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:56:06,916 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-07 20:56:06,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-07 20:56:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 20:56:06,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:56:06,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:56:06,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:56:06,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:56:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:56:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 399863557, now seen corresponding path program 1 times [2024-11-07 20:56:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:56:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328172948] [2024-11-07 20:56:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:56:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:56:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:56:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:56:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:56:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328172948] [2024-11-07 20:56:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328172948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:56:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660874503] [2024-11-07 20:56:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:56:07,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:56:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:56:07,254 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) [2024-11-07 20:56:07,255 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 [2024-11-07 20:56:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:56:07,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 20:56:07,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:56:07,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 20:56:07,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 20:56:07,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 20:56:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:56:07,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:56:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:56:07,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660874503] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 20:56:07,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:56:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 22 [2024-11-07 20:56:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518993167] [2024-11-07 20:56:07,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:56:07,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 20:56:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:56:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 20:56:07,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-07 20:56:07,651 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:56:07,763 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-07 20:56:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:56:07,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 20:56:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:56:07,765 INFO L225 Difference]: With dead ends: 15 [2024-11-07 20:56:07,765 INFO L226 Difference]: Without dead ends: 14 [2024-11-07 20:56:07,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-11-07 20:56:07,766 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:56:07,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:56:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-07 20:56:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-07 20:56:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-07 20:56:07,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2024-11-07 20:56:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:56:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-07 20:56:07,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-07 20:56:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:56:07,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:56:07,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 20:56:07,783 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 [2024-11-07 20:56:07,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:56:07,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:56:07,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:56:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -489131584, now seen corresponding path program 1 times [2024-11-07 20:56:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:56:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846744782] [2024-11-07 20:56:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:56:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:56:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:56:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 20:56:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:56:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846744782] [2024-11-07 20:56:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846744782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:56:08,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:56:08,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:56:08,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260954472] [2024-11-07 20:56:08,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:56:08,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:56:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:56:08,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:56:08,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:56:08,007 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:56:08,013 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-07 20:56:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:56:08,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 20:56:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:56:08,014 INFO L225 Difference]: With dead ends: 13 [2024-11-07 20:56:08,014 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:56:08,014 INFO L431 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 [2024-11-07 20:56:08,015 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:56:08,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:56:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:56:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:56:08,015 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) [2024-11-07 20:56:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:56:08,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-07 20:56:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:56:08,016 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:56:08,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:56:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:56:08,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:56:08,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_19_to_19_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-07 20:56:08,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_19_to_19_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-07 20:56:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:56:08,020 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 20:56:08,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:56:08,079 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:56:08,095 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_19_to_19_0 contained old-variable. Original clause: (let ((.cse0 (select (select |old(#memory_int#1)| |func_to_recursive_line_19_to_19_0_#in~a.base|) |func_to_recursive_line_19_to_19_0_#in~a.offset|)) (.cse1 (select (select |#memory_int#1| |func_to_recursive_line_19_to_19_0_#in~a.base|) |func_to_recursive_line_19_to_19_0_#in~a.offset|))) (and (or (not (= .cse0 0)) (= .cse1 0)) (< 0 (+ 2147483650 .cse0)) (< 0 (+ .cse1 2147483650)))) Eliminated clause: (let ((.cse0 (select (select |#memory_int#1| |func_to_recursive_line_19_to_19_0_#in~a.base|) |func_to_recursive_line_19_to_19_0_#in~a.offset|))) (and (<= 0 (+ 2147483649 .cse0)) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |old(#memory_int#1)| |func_to_recursive_line_19_to_19_0_#in~a.base|) |func_to_recursive_line_19_to_19_0_#in~a.offset|))) (and (<= 0 (+ 2147483649 .cse1)) (or (not (= .cse1 0)) (= .cse0 0))))))) [2024-11-07 20:56:08,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-07 20:56:08,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-07 20:56:08,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-07 20:56:08,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 20:56:08,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-07 20:56:08,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-07 20:56:08,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-07 20:56:08,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:56:08 BoogieIcfgContainer [2024-11-07 20:56:08,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:56:08,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:56:08,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:56:08,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:56:08,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:06" (3/4) ... [2024-11-07 20:56:08,112 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:56:08,118 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_19_to_19_0 [2024-11-07 20:56:08,120 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-07 20:56:08,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:56:08,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:56:08,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:56:08,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:56:08,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:56:08,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:56:08,182 INFO L158 Benchmark]: Toolchain (without parser) took 2266.25ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.6MB in the beginning and 67.7MB in the end (delta: 23.9MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-11-07 20:56:08,183 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:56:08,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 110.19ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 81.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:56:08,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.83ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:56:08,183 INFO L158 Benchmark]: Boogie Preprocessor took 16.48ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:56:08,184 INFO L158 Benchmark]: RCFGBuilder took 148.63ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 69.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:56:08,184 INFO L158 Benchmark]: TraceAbstraction took 1898.47ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 69.0MB in the beginning and 72.4MB in the end (delta: -3.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-07 20:56:08,185 INFO L158 Benchmark]: Witness Printer took 72.01ms. Allocated memory is still 167.8MB. Free memory was 71.8MB in the beginning and 67.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:56:08,187 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.88ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 110.19ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 81.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.83ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.48ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 148.63ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 69.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1898.47ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 69.0MB in the beginning and 72.4MB in the end (delta: -3.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 72.01ms. Allocated memory is still 167.8MB. Free memory was 71.8MB in the beginning and 67.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] * 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 30 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 SizeOfPredicates, 9 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 8/13 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 20:56:08,207 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