./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:17:49,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:17:49,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:17:49,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:17:49,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:17:49,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:17:49,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:17:50,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:17:50,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:17:50,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:17:50,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:17:50,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:17:50,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:17:50,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:17:50,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:17:50,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:17:50,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:17:50,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:17:50,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:17:50,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:17:50,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:17:50,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:17:50,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:17:50,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:17:50,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:17:50,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:17:50,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:17:50,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:17:50,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:17:50,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:17:50,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:17:50,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:17:50,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:17:50,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:17:50,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:17:50,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:17:50,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:17:50,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:17:50,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:17:50,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:17:50,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:17:50,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:17:50,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:17:50,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:17:50,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:17:50,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:17:50,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:17:50,064 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:17:50,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:17:50,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:17:50,064 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:17:50,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:17:50,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:17:50,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:17:50,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:17:50,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:17:50,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:17:50,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:17:50,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:17:50,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:17:50,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:17:50,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:17:50,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:17:50,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:17:50,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:17:50,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:17:50,068 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:17:50,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:17:50,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:17:50,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! call(reach_error())) ) 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 -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2022-02-20 18:17:50,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:17:50,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:17:50,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:17:50,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:17:50,319 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:17:50,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2022-02-20 18:17:50,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c192bd16a/60b4457690f4441d9e8c7469cb5dfda2/FLAGbcfd11811 [2022-02-20 18:17:50,715 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:17:50,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2022-02-20 18:17:50,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c192bd16a/60b4457690f4441d9e8c7469cb5dfda2/FLAGbcfd11811 [2022-02-20 18:17:51,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c192bd16a/60b4457690f4441d9e8c7469cb5dfda2 [2022-02-20 18:17:51,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:17:51,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:17:51,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:17:51,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:17:51,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:17:51,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b6646f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51, skipping insertion in model container [2022-02-20 18:17:51,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:17:51,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:17:51,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2022-02-20 18:17:51,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:17:51,418 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:17:51,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2022-02-20 18:17:51,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:17:51,478 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:17:51,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51 WrapperNode [2022-02-20 18:17:51,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:17:51,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:17:51,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:17:51,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:17:51,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,516 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-02-20 18:17:51,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:17:51,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:17:51,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:17:51,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:17:51,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:17:51,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:17:51,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:17:51,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:17:51,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (1/1) ... [2022-02-20 18:17:51,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:17:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:17:51,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:17:51,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:17:51,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:17:51,678 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2022-02-20 18:17:51,679 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2022-02-20 18:17:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:17:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 18:17:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2022-02-20 18:17:51,679 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2022-02-20 18:17:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 18:17:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:17:51,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:17:51,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 18:17:51,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 18:17:51,722 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:17:51,723 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:17:51,809 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:17:51,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:17:51,814 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:17:51,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:17:51 BoogieIcfgContainer [2022-02-20 18:17:51,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:17:51,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:17:51,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:17:51,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:17:51,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:17:51" (1/3) ... [2022-02-20 18:17:51,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362ae6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:17:51, skipping insertion in model container [2022-02-20 18:17:51,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:17:51" (2/3) ... [2022-02-20 18:17:51,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362ae6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:17:51, skipping insertion in model container [2022-02-20 18:17:51,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:17:51" (3/3) ... [2022-02-20 18:17:51,821 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2022-02-20 18:17:51,825 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:17:51,825 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:17:51,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:17:51,859 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:17:51,859 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:17:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:17:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 18:17:51,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:17:51,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:17:51,876 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:17:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:17:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -694887038, now seen corresponding path program 1 times [2022-02-20 18:17:51,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:17:51,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24886719] [2022-02-20 18:17:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:17:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:52,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-02-20 18:17:52,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~#x~0#1.base, main_~#x~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(0, main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;call write~int(10, main_~p~0#1.base, main_~p~0#1.offset, 4); {24#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 10)} is VALID [2022-02-20 18:17:52,055 INFO L272 TraceCheckUtils]: 2: Hoare triple {24#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 10)} call foo(main_~p~0#1.base, main_~p~0#1.offset); {25#(= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 10)} is VALID [2022-02-20 18:17:52,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#(= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 10)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {26#(= (+ |foo_#t~mem6| (- 10)) 0)} is VALID [2022-02-20 18:17:52,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#(= (+ |foo_#t~mem6| (- 10)) 0)} assume !(#t~mem6 < 20);havoc #t~mem6;call #t~mem7 := read~int(~p.base, ~p.offset, 4); {23#false} is VALID [2022-02-20 18:17:52,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#false} assume !(20 == #t~mem7);havoc #t~mem7; {23#false} is VALID [2022-02-20 18:17:52,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 18:17:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:17:52,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:17:52,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24886719] [2022-02-20 18:17:52,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24886719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:17:52,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:17:52,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:17:52,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478467830] [2022-02-20 18:17:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:17:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 [2022-02-20 18:17:52,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:17:52,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 18:17:52,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:52,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:17:52,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:17:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:17:52,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:17:52,115 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 18:17:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:52,317 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 18:17:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:17:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 [2022-02-20 18:17:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:17:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 18:17:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-20 18:17:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 18:17:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-20 18:17:52,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-02-20 18:17:52,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:52,373 INFO L225 Difference]: With dead ends: 33 [2022-02-20 18:17:52,373 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 18:17:52,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:17:52,382 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:17:52,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:17:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 18:17:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-20 18:17:52,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:17:52,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:52,413 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:52,413 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:52,415 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-20 18:17:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-20 18:17:52,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:52,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-20 18:17:52,417 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-20 18:17:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:52,418 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-20 18:17:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-20 18:17:52,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:52,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:52,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:17:52,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:17:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-20 18:17:52,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-02-20 18:17:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:17:52,422 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-20 18:17:52,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 18:17:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 18:17:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 18:17:52,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:17:52,424 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:17:52,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:17:52,424 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:17:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:17:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2070363059, now seen corresponding path program 1 times [2022-02-20 18:17:52,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:17:52,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952803289] [2022-02-20 18:17:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:17:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:52,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-02-20 18:17:52,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~#x~0#1.base, main_~#x~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(0, main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;call write~int(10, main_~p~0#1.base, main_~p~0#1.offset, 4); {120#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 10)} is VALID [2022-02-20 18:17:52,536 INFO L272 TraceCheckUtils]: 2: Hoare triple {120#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 10)} call foo(main_~p~0#1.base, main_~p~0#1.offset); {121#(= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 10)} is VALID [2022-02-20 18:17:52,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 10)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {122#(= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 10)} is VALID [2022-02-20 18:17:52,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {122#(= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 10)} assume #t~mem6 < 20;havoc #t~mem6; {122#(= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 10)} is VALID [2022-02-20 18:17:52,538 INFO L272 TraceCheckUtils]: 5: Hoare triple {122#(= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 10)} call plus(~p.base, ~p.offset); {123#(= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 10)} is VALID [2022-02-20 18:17:52,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 10)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(1 + #t~post5, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {124#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} is VALID [2022-02-20 18:17:52,540 INFO L272 TraceCheckUtils]: 7: Hoare triple {124#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} call foo(~p.base, ~p.offset); {125#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} is VALID [2022-02-20 18:17:52,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {125#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {126#(<= |foo_#t~mem6| 11)} is VALID [2022-02-20 18:17:52,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#(<= |foo_#t~mem6| 11)} assume !(#t~mem6 < 20);havoc #t~mem6;call #t~mem7 := read~int(~p.base, ~p.offset, 4); {119#false} is VALID [2022-02-20 18:17:52,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !(20 == #t~mem7);havoc #t~mem7; {119#false} is VALID [2022-02-20 18:17:52,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 18:17:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:17:52,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:17:52,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952803289] [2022-02-20 18:17:52,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952803289] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:17:52,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130058642] [2022-02-20 18:17:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:52,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:17:52,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:17:52,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:17:52,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:17:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:52,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 18:17:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:52,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:17:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-02-20 18:17:53,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-02-20 18:17:53,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-02-20 18:17:53,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~#x~0#1.base, main_~#x~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(0, main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;call write~int(10, main_~p~0#1.base, main_~p~0#1.offset, 4); {118#true} is VALID [2022-02-20 18:17:53,140 INFO L272 TraceCheckUtils]: 2: Hoare triple {118#true} call foo(main_~p~0#1.base, main_~p~0#1.offset); {118#true} is VALID [2022-02-20 18:17:53,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {139#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) |foo_#t~mem6|)} is VALID [2022-02-20 18:17:53,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) |foo_#t~mem6|)} assume #t~mem6 < 20;havoc #t~mem6; {143#(< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20)} is VALID [2022-02-20 18:17:53,142 INFO L272 TraceCheckUtils]: 5: Hoare triple {143#(< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20)} call plus(~p.base, ~p.offset); {147#(< (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 20)} is VALID [2022-02-20 18:17:53,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(< (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 20)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(1 + #t~post5, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {151#(< (select (select |#memory_int| plus_~p.base) plus_~p.offset) 21)} is VALID [2022-02-20 18:17:53,144 INFO L272 TraceCheckUtils]: 7: Hoare triple {151#(< (select (select |#memory_int| plus_~p.base) plus_~p.offset) 21)} call foo(~p.base, ~p.offset); {155#(< (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 21)} is VALID [2022-02-20 18:17:53,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(< (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 21)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {159#(and (<= |foo_#t~mem6| (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 21))} is VALID [2022-02-20 18:17:53,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {159#(and (<= |foo_#t~mem6| (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 21))} assume !(#t~mem6 < 20);havoc #t~mem6;call #t~mem7 := read~int(~p.base, ~p.offset, 4); {163#(and (<= 20 |foo_#t~mem7|) (< |foo_#t~mem7| 21))} is VALID [2022-02-20 18:17:53,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(and (<= 20 |foo_#t~mem7|) (< |foo_#t~mem7| 21))} assume !(20 == #t~mem7);havoc #t~mem7; {119#false} is VALID [2022-02-20 18:17:53,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 18:17:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:17:53,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:17:53,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 18:17:53,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(and (<= 20 |foo_#t~mem7|) (< |foo_#t~mem7| 21))} assume !(20 == #t~mem7);havoc #t~mem7; {119#false} is VALID [2022-02-20 18:17:53,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#(or (< |foo_#t~mem6| 20) (and (<= 20 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 21)))} assume !(#t~mem6 < 20);havoc #t~mem6;call #t~mem7 := read~int(~p.base, ~p.offset, 4); {163#(and (<= 20 |foo_#t~mem7|) (< |foo_#t~mem7| 21))} is VALID [2022-02-20 18:17:53,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(< (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 21)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {176#(or (< |foo_#t~mem6| 20) (and (<= 20 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 21)))} is VALID [2022-02-20 18:17:53,334 INFO L272 TraceCheckUtils]: 7: Hoare triple {151#(< (select (select |#memory_int| plus_~p.base) plus_~p.offset) 21)} call foo(~p.base, ~p.offset); {155#(< (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 21)} is VALID [2022-02-20 18:17:53,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(< (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 20)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(1 + #t~post5, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {151#(< (select (select |#memory_int| plus_~p.base) plus_~p.offset) 21)} is VALID [2022-02-20 18:17:53,335 INFO L272 TraceCheckUtils]: 5: Hoare triple {143#(< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20)} call plus(~p.base, ~p.offset); {147#(< (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 20)} is VALID [2022-02-20 18:17:53,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(or (not (< |foo_#t~mem6| 20)) (< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20))} assume #t~mem6 < 20;havoc #t~mem6; {143#(< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20)} is VALID [2022-02-20 18:17:53,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem6 := read~int(~p.base, ~p.offset, 4); {192#(or (not (< |foo_#t~mem6| 20)) (< (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20))} is VALID [2022-02-20 18:17:53,337 INFO L272 TraceCheckUtils]: 2: Hoare triple {118#true} call foo(main_~p~0#1.base, main_~p~0#1.offset); {118#true} is VALID [2022-02-20 18:17:53,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~#x~0#1.base, main_~#x~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(0, main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;call write~int(10, main_~p~0#1.base, main_~p~0#1.offset, 4); {118#true} is VALID [2022-02-20 18:17:53,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-02-20 18:17:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:17:53,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130058642] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:17:53,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:17:53,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-20 18:17:53,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900693655] [2022-02-20 18:17:53,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:17:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 18:17:53,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:17:53,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:53,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:53,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:17:53,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:17:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:17:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:17:53,362 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:53,727 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 18:17:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:17:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 18:17:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:17:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-20 18:17:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-20 18:17:53,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-02-20 18:17:53,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:53,750 INFO L225 Difference]: With dead ends: 20 [2022-02-20 18:17:53,750 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:17:53,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:17:53,752 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:17:53,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:17:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:17:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:17:53,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:17:53,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 18:17:53,754 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 18:17:53,755 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 18:17:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:53,755 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:17:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:17:53,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:53,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:53,756 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 18:17:53,756 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 18:17:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:53,756 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:17:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:17:53,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:53,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:53,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:17:53,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:17:53,757 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) [2022-02-20 18:17:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:17:53,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-02-20 18:17:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:17:53,758 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:17:53,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:17:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:17:53,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:53,761 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:17:53,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:17:53,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:17:53,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:17:54,095 INFO L858 garLoopResultBuilder]: For program point fooEXIT(lines 11 20) no Hoare annotation was computed. [2022-02-20 18:17:54,096 INFO L854 garLoopResultBuilder]: At program point fooENTRY(lines 11 20) the Hoare annotation is: (let ((.cse1 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse0 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (= .cse0 10) (not (= .cse1 10))) (or (not (< .cse1 21)) (< .cse0 21)) (or (not (<= .cse1 11)) (<= .cse0 11)))) [2022-02-20 18:17:54,096 INFO L858 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-02-20 18:17:54,096 INFO L858 garLoopResultBuilder]: For program point fooErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-02-20 18:17:54,096 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 19) no Hoare annotation was computed. [2022-02-20 18:17:54,097 INFO L854 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (< .cse0 21)) (and (< .cse1 21) (< .cse2 20))) (or (and (= .cse1 10) (= .cse2 10)) (not (= .cse0 10))) (or (not (<= .cse0 11)) (<= .cse1 11)))) [2022-02-20 18:17:54,097 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 19) no Hoare annotation was computed. [2022-02-20 18:17:54,097 INFO L858 garLoopResultBuilder]: For program point L12-1(lines 11 20) no Hoare annotation was computed. [2022-02-20 18:17:54,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:17:54,097 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:17:54,098 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:17:54,098 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:17:54,098 INFO L854 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 10) [2022-02-20 18:17:54,098 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-02-20 18:17:54,098 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 28) no Hoare annotation was computed. [2022-02-20 18:17:54,099 INFO L858 garLoopResultBuilder]: For program point plusFINAL(lines 6 9) no Hoare annotation was computed. [2022-02-20 18:17:54,099 INFO L854 garLoopResultBuilder]: At program point plusENTRY(lines 6 9) the Hoare annotation is: (let ((.cse1 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse0 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (< .cse0 20) (not (< .cse1 20))) (or (not (= .cse1 10)) (= .cse0 10)))) [2022-02-20 18:17:54,099 INFO L858 garLoopResultBuilder]: For program point plusEXIT(lines 6 9) no Hoare annotation was computed. [2022-02-20 18:17:54,099 INFO L854 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (let ((.cse1 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse0 (select (select |#memory_int| plus_~p.base) plus_~p.offset))) (and (or (< .cse0 21) (not (< .cse1 20))) (or (not (= .cse1 10)) (and (<= .cse0 11) (< (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 20))))) [2022-02-20 18:17:54,102 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 18:17:54,103 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:17:54,106 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:17:54,106 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:17:54,108 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:17:54,108 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:17:54,108 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:17:54,109 WARN L170 areAnnotationChecker]: plusFINAL has no Hoare annotation [2022-02-20 18:17:54,110 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-02-20 18:17:54,111 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 18:17:54,111 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 18:17:54,111 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 18:17:54,112 WARN L170 areAnnotationChecker]: plusFINAL has no Hoare annotation [2022-02-20 18:17:54,112 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-02-20 18:17:54,112 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:17:54,112 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:17:54,113 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 18:17:54,113 WARN L170 areAnnotationChecker]: plusEXIT has no Hoare annotation [2022-02-20 18:17:54,113 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-02-20 18:17:54,113 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-02-20 18:17:54,113 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 18:17:54,113 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:17:54,113 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:17:54,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:17:54 BoogieIcfgContainer [2022-02-20 18:17:54,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:17:54,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:17:54,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:17:54,115 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:17:54,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:17:51" (3/4) ... [2022-02-20 18:17:54,118 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:17:54,122 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2022-02-20 18:17:54,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2022-02-20 18:17:54,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-02-20 18:17:54,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:17:54,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:17:54,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:17:54,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:17:54,150 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:17:54,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:17:54,151 INFO L158 Benchmark]: Toolchain (without parser) took 3046.25ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 53.8MB in the beginning and 92.7MB in the end (delta: -39.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:17:54,151 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:17:54,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.52ms. Allocated memory is still 90.2MB. Free memory was 53.6MB in the beginning and 67.1MB in the end (delta: -13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:17:54,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.45ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 65.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:17:54,152 INFO L158 Benchmark]: Boogie Preprocessor took 31.04ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 64.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:17:54,153 INFO L158 Benchmark]: RCFGBuilder took 266.43ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 54.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 18:17:54,153 INFO L158 Benchmark]: TraceAbstraction took 2297.70ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 53.9MB in the beginning and 95.9MB in the end (delta: -42.0MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2022-02-20 18:17:54,153 INFO L158 Benchmark]: Witness Printer took 35.16ms. Allocated memory is still 125.8MB. Free memory was 95.9MB in the beginning and 92.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:17:54,155 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.52ms. Allocated memory is still 90.2MB. Free memory was 53.6MB in the beginning and 67.1MB in the end (delta: -13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.45ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 65.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.04ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 64.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.43ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 54.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2297.70ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 53.9MB in the beginning and 95.9MB in the end (delta: -42.0MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * Witness Printer took 35.16ms. Allocated memory is still 125.8MB. Free memory was 95.9MB in the beginning and 92.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 24 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 195 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 10 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2/6 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 18:17:54,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE