./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array15_alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array15_alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:52:54,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:52:54,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:52:54,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:52:54,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:52:54,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:52:54,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:52:54,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:52:54,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:52:54,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:52:54,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:52:54,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:52:54,763 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:52:54,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:52:54,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:52:54,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:52:54,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:52:54,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:52:54,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:52:54,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:52:54,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:52:54,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:52:54,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:52:54,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:52:54,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:52:54,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:52:54,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:52:54,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:52:54,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:52:54,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:52:54,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:52:54,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:52:54,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:52:54,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:52:54,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:52:54,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:52:54,781 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:52:54,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:52:54,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:52:54,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:52:54,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:52:54,795 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:52:54,795 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:52:54,795 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:52:54,796 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:52:54,796 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:52:54,796 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:52:54,796 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:52:54,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:52:54,796 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:52:54,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:52:54,797 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:52:54,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:52:54,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:52:54,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:52:54,798 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:52:54,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:52:54,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:52:54,798 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:52:54,799 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:52:54,799 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2018-11-22 22:52:54,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:52:54,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:52:54,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:52:54,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:52:54,837 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:52:54,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array15_alloca_false-termination.c.i [2018-11-22 22:52:54,879 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/data/421adea59/8f903f2b7aef4b7f8f0ebd4a44558d18/FLAG5d709b761 [2018-11-22 22:52:55,270 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:52:55,271 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/sv-benchmarks/c/termination-15/array15_alloca_false-termination.c.i [2018-11-22 22:52:55,277 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/data/421adea59/8f903f2b7aef4b7f8f0ebd4a44558d18/FLAG5d709b761 [2018-11-22 22:52:55,288 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/data/421adea59/8f903f2b7aef4b7f8f0ebd4a44558d18 [2018-11-22 22:52:55,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:52:55,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:52:55,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:52:55,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:52:55,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:52:55,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172b0922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55, skipping insertion in model container [2018-11-22 22:52:55,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:52:55,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:52:55,600 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:52:55,610 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:52:55,724 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:52:55,757 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:52:55,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55 WrapperNode [2018-11-22 22:52:55,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:52:55,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:52:55,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:52:55,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:52:55,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:52:55,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:52:55,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:52:55,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:52:55,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... [2018-11-22 22:52:55,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:52:55,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:52:55,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:52:55,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:52:55,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:52:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:52:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:52:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:52:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:52:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:52:55,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:52:56,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:52:56,012 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-22 22:52:56,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:52:56 BoogieIcfgContainer [2018-11-22 22:52:56,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:52:56,013 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:52:56,014 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:52:56,016 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:52:56,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:52:56,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:52:55" (1/3) ... [2018-11-22 22:52:56,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4627aadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:52:56, skipping insertion in model container [2018-11-22 22:52:56,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:52:56,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:52:55" (2/3) ... [2018-11-22 22:52:56,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4627aadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:52:56, skipping insertion in model container [2018-11-22 22:52:56,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:52:56,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:52:56" (3/3) ... [2018-11-22 22:52:56,020 INFO L375 chiAutomizerObserver]: Analyzing ICFG array15_alloca_false-termination.c.i [2018-11-22 22:52:56,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:52:56,065 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:52:56,065 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:52:56,066 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:52:56,066 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:52:56,066 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:52:56,066 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:52:56,066 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:52:56,066 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:52:56,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-22 22:52:56,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-22 22:52:56,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:56,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:56,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:52:56,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:52:56,104 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:52:56,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-22 22:52:56,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-22 22:52:56,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:56,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:56,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:52:56,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:52:56,114 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2018-11-22 22:52:56,116 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2018-11-22 22:52:56,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-22 22:52:56,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:56,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:56,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:56,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-11-22 22:52:56,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:56,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:56,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:56,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-11-22 22:52:56,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:56,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:56,445 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:52:56,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:52:56,447 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:52:56,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:52:56,447 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:52:56,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:52:56,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:52:56,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:52:56,448 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration1_Lasso [2018-11-22 22:52:56,448 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:52:56,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:52:56,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:56,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:52:56,764 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:52:56,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:56,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:56,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:56,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:56,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:56,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:56,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:56,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:56,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:56,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:56,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:56,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:56,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:56,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:56,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:56,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:56,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:56,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:56,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:56,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:56,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:56,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:56,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:56,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:56,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:56,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:56,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:56,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:56,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:56,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:56,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:52:56,886 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:52:56,886 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:52:56,888 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:52:56,890 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:52:56,890 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:52:56,890 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-22 22:52:56,910 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:52:56,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:56,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:56,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:56,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:52:56,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-22 22:52:57,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2018-11-22 22:52:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 22:52:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:52:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-22 22:52:57,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-22 22:52:57,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:57,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-22 22:52:57,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:57,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-22 22:52:57,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:57,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-11-22 22:52:57,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:57,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-11-22 22:52:57,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-22 22:52:57,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:52:57,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-22 22:52:57,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:52:57,051 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-22 22:52:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-22 22:52:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-22 22:52:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-22 22:52:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-22 22:52:57,072 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-22 22:52:57,072 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-22 22:52:57,072 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:52:57,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-22 22:52:57,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:57,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:57,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:57,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:52:57,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:52:57,074 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2018-11-22 22:52:57,074 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2018-11-22 22:52:57,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-11-22 22:52:57,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:57,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:52:57,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:52:57,114 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:52:57,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-11-22 22:52:57,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:52:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:52:57,157 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-22 22:52:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:52:57,182 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-22 22:52:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:52:57,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-22 22:52:57,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:57,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-11-22 22:52:57,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 22:52:57,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:52:57,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-22 22:52:57,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:52:57,184 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-22 22:52:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-22 22:52:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-22 22:52:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-22 22:52:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-22 22:52:57,186 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-22 22:52:57,186 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-22 22:52:57,186 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:52:57,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-22 22:52:57,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:57,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:57,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:57,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:52:57,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:52:57,188 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2018-11-22 22:52:57,188 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2018-11-22 22:52:57,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-11-22 22:52:57,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-11-22 22:52:57,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-11-22 22:52:57,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,397 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-11-22 22:52:57,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:52:57,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:52:57,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:52:57,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:52:57,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:52:57,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:52:57,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:52:57,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:52:57,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration3_Lasso [2018-11-22 22:52:57,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:52:57,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:52:57,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:57,706 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:52:57,707 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:52:57,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:57,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:57,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:57,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:57,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:57,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:57,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:57,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:57,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:57,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:57,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:57,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:57,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:57,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:57,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:57,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:57,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:57,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:57,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:57,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:57,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:57,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:57,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,730 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:52:57,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:52:57,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:57,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:57,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:57,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:57,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:57,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:57,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:57,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:57,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:57,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:57,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:57,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:57,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:57,768 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:52:57,782 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:52:57,782 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-22 22:52:57,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:52:57,784 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:52:57,784 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:52:57,784 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2018-11-22 22:52:57,795 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:52:57,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:57,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:57,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:57,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:52:57,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-22 22:52:57,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2018-11-22 22:52:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:52:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:52:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-22 22:52:57,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-22 22:52:57,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:57,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-22 22:52:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:57,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-22 22:52:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:57,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-22 22:52:57,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:57,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-11-22 22:52:57,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:52:57,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:52:57,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-22 22:52:57,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:52:57,865 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 22:52:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-22 22:52:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-22 22:52:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-22 22:52:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-22 22:52:57,868 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 22:52:57,868 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 22:52:57,868 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:52:57,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-22 22:52:57,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:57,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:57,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:57,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:52:57,870 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:52:57,870 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2018-11-22 22:52:57,870 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2018-11-22 22:52:57,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-11-22 22:52:57,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-11-22 22:52:57,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:57,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-11-22 22:52:57,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:57,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:52:57,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:52:57,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:57,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:52:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-22 22:52:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:52:58,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:52:58,029 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-22 22:52:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:52:58,166 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-11-22 22:52:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:52:58,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2018-11-22 22:52:58,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:58,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2018-11-22 22:52:58,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 22:52:58,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:52:58,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2018-11-22 22:52:58,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:52:58,168 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-22 22:52:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2018-11-22 22:52:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-22 22:52:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 22:52:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-22 22:52:58,170 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-22 22:52:58,170 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-22 22:52:58,170 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:52:58,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-22 22:52:58,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:58,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:58,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:58,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:52:58,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:52:58,171 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 360#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 361#L367 assume !(main_~length~0 < 1); 370#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 371#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 372#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 375#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 373#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 374#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 358#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 359#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 376#L370-3 assume !(main_~i~0 < main_~length~0); 362#L370-4 main_~j~0 := 0; 363#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 369#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 365#L378-2 [2018-11-22 22:52:58,171 INFO L796 eck$LassoCheckResult]: Loop: 365#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 366#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 365#L378-2 [2018-11-22 22:52:58,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2018-11-22 22:52:58,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-11-22 22:52:58,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:58,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2018-11-22 22:52:58,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:58,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,395 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-22 22:52:58,445 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:52:58,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:52:58,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:52:58,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:52:58,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:52:58,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:52:58,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:52:58,446 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:52:58,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration5_Lasso [2018-11-22 22:52:58,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:52:58,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:52:58,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:52:58,686 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:52:58,686 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:52:58,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:58,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:58,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:52:58,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:58,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:58,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:58,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:52:58,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:52:58,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:58,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:58,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:58,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:58,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:58,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:58,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:58,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:58,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:58,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:58,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:58,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:58,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:58,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:58,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:58,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:58,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:58,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:58,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:58,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:58,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:58,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:58,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:58,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:58,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:58,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:58,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:58,698 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:52:58,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:58,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:58,700 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:52:58,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:58,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:52:58,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:52:58,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:52:58,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:52:58,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:52:58,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:52:58,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:52:58,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:52:58,721 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:52:58,732 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:52:58,732 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 22:52:58,732 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:52:58,733 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:52:58,733 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:52:58,733 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2018-11-22 22:52:58,764 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:52:58,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:58,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:58,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:58,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:52:58,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-22 22:52:58,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2018-11-22 22:52:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:52:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:52:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-22 22:52:58,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-22 22:52:58,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:58,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-22 22:52:58,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:58,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-22 22:52:58,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:52:58,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2018-11-22 22:52:58,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:58,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2018-11-22 22:52:58,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-22 22:52:58,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 22:52:58,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2018-11-22 22:52:58,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:52:58,813 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-22 22:52:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2018-11-22 22:52:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-22 22:52:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 22:52:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-11-22 22:52:58,815 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-22 22:52:58,815 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-22 22:52:58,815 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:52:58,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2018-11-22 22:52:58,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:52:58,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:58,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:58,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:52:58,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:52:58,817 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 489#L367 assume !(main_~length~0 < 1); 500#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 506#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 490#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 491#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 492#L370-4 main_~j~0 := 0; 493#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 499#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 505#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 508#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 495#L378-2 [2018-11-22 22:52:58,817 INFO L796 eck$LassoCheckResult]: Loop: 495#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 496#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 495#L378-2 [2018-11-22 22:52:58,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2018-11-22 22:52:58,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:58,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-11-22 22:52:58,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:58,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:58,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2018-11-22 22:52:58,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:52:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:58,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:52:58,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:52:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:52:58,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 22:52:58,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:52:58,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:52:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:52:59,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:52:59,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-22 22:52:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:52:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:52:59,052 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-22 22:52:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:52:59,141 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-11-22 22:52:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:52:59,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2018-11-22 22:52:59,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:52:59,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2018-11-22 22:52:59,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-22 22:52:59,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-22 22:52:59,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2018-11-22 22:52:59,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:52:59,144 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-22 22:52:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2018-11-22 22:52:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-22 22:52:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 22:52:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-11-22 22:52:59,147 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-22 22:52:59,147 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-22 22:52:59,147 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:52:59,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2018-11-22 22:52:59,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:52:59,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:52:59,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:52:59,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:52:59,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-22 22:52:59,149 INFO L794 eck$LassoCheckResult]: Stem: 643#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 637#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 638#L367 assume !(main_~length~0 < 1); 649#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 650#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 651#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 657#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 658#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 659#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 652#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 653#L370-3 assume !(main_~i~0 < main_~length~0); 641#L370-4 main_~j~0 := 0; 642#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 662#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 661#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 655#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 656#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 672#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 670#L378-2 [2018-11-22 22:52:59,149 INFO L796 eck$LassoCheckResult]: Loop: 670#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 667#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 644#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 645#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 670#L378-2 [2018-11-22 22:52:59,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2018-11-22 22:52:59,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:59,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:59,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:59,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-11-22 22:52:59,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:59,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:59,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:52:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:59,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:52:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2018-11-22 22:52:59,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:52:59,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:52:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:59,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:52:59,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:52:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:52:59,472 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; [?] assume !(main_~length~0 < 1); [?] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [?] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !(main_~i~0 < main_~length~0); [?] main_~j~0 := 0; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- [2018-11-22 22:52:59,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:52:59 BoogieIcfgContainer [2018-11-22 22:52:59,553 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:52:59,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:52:59,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:52:59,553 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:52:59,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:52:56" (3/4) ... [2018-11-22 22:52:59,557 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; [?] assume !(main_~length~0 < 1); [?] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [?] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !(main_~i~0 < main_~length~0); [?] main_~j~0 := 0; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- [2018-11-22 22:52:59,600 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ba29c654-d72a-427a-9fcb-cacc57bbad85/bin-2019/uautomizer/witness.graphml [2018-11-22 22:52:59,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:52:59,601 INFO L168 Benchmark]: Toolchain (without parser) took 4309.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:52:59,601 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:52:59,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:52:59,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:52:59,602 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:52:59,603 INFO L168 Benchmark]: RCFGBuilder took 199.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:52:59,603 INFO L168 Benchmark]: BuchiAutomizer took 3539.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:52:59,604 INFO L168 Benchmark]: Witness Printer took 47.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:52:59,607 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 199.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3539.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. * Witness Printer took 47.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 65 SDtfs, 105 SDslu, 79 SDs, 0 SdLazy, 194 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf98 lsp93 ukn81 mio100 lsp63 div100 bol100 ite100 ukn100 eq159 hnf90 smp93 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=3, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c450107=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6574afec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77d759e0=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@2d1add51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77d759e0=3, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1347fdf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@13ecfa1c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1ef9d7b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@f253d04=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; [?] assume !(main_~length~0 < 1); [?] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [?] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !(main_~i~0 < main_~length~0); [?] main_~j~0 := 0; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; [?] assume !(main_~length~0 < 1); [?] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [?] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 0);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !(main_~i~0 < main_~length~0); [?] main_~j~0 := 0; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 0); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 0) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 0) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume main_#t~mem210 > 0; [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(main_#t~mem210 > 0); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE main_#t~mem210 > 0 [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := main_#t~post211 - 1; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(main_#t~mem210 > 0) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := 1 + main_#t~post212; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE #t~mem210 > 0 [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := #t~post211 - 1; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(#t~mem210 > 0) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := 1 + #t~post212; [L381] havoc #t~post212; [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...