./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array14_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_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array14_alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/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 519b4f74907cdda12f126cdccb2c6422dda5240e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-23 06:05:26,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:05:26,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:05:26,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:05:26,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:05:26,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:05:26,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:05:26,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:05:26,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:05:26,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:05:26,157 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:05:26,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:05:26,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:05:26,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:05:26,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:05:26,160 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:05:26,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:05:26,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:05:26,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:05:26,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:05:26,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:05:26,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:05:26,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:05:26,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:05:26,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:05:26,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:05:26,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:05:26,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:05:26,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:05:26,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:05:26,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:05:26,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:05:26,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:05:26,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:05:26,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:05:26,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:05:26,173 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:05:26,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:05:26,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:05:26,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:05:26,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:05:26,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:05:26,185 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:05:26,185 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:05:26,185 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:05:26,185 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:05:26,185 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:05:26,185 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:05:26,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:05:26,186 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:05:26,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:05:26,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:05:26,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:05:26,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:05:26,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:05:26,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:05:26,187 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:05:26,187 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:05:26,187 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:05:26,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:05:26,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:05:26,188 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:05:26,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:05:26,188 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:05:26,188 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:05:26,189 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:05:26,189 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_9b8c1442-71a5-4578-a254-25d16fc0b3a5/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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2018-11-23 06:05:26,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:05:26,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:05:26,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:05:26,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:05:26,225 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:05:26,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array14_alloca_false-termination.c.i [2018-11-23 06:05:26,264 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/data/883a8aa85/d9468188a6974d86baaa96a72d857d0b/FLAGd77dbf2d4 [2018-11-23 06:05:26,693 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:05:26,693 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/sv-benchmarks/c/termination-15/array14_alloca_false-termination.c.i [2018-11-23 06:05:26,698 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/data/883a8aa85/d9468188a6974d86baaa96a72d857d0b/FLAGd77dbf2d4 [2018-11-23 06:05:26,708 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/bin-2019/uautomizer/data/883a8aa85/d9468188a6974d86baaa96a72d857d0b [2018-11-23 06:05:26,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:05:26,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:05:26,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:05:26,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:05:26,716 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:05:26,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:05:26" (1/1) ... [2018-11-23 06:05:26,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335f4bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:26, skipping insertion in model container [2018-11-23 06:05:26,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:05:26" (1/1) ... [2018-11-23 06:05:26,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:05:26,748 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:05:26,947 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:05:26,955 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:05:27,041 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:05:27,081 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:05:27,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27 WrapperNode [2018-11-23 06:05:27,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:05:27,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:05:27,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:05:27,083 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:05:27,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:05:27,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:05:27,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:05:27,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:05:27,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... [2018-11-23 06:05:27,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:05:27,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:05:27,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:05:27,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:05:27,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/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-23 06:05:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:05:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:05:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:05:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:05:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:05:27,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:05:27,322 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:05:27,322 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 06:05:27,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:05:27 BoogieIcfgContainer [2018-11-23 06:05:27,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:05:27,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:05:27,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:05:27,326 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:05:27,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:05:27,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:05:26" (1/3) ... [2018-11-23 06:05:27,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f40cbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:05:27, skipping insertion in model container [2018-11-23 06:05:27,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:05:27,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:27" (2/3) ... [2018-11-23 06:05:27,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f40cbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:05:27, skipping insertion in model container [2018-11-23 06:05:27,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:05:27,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:05:27" (3/3) ... [2018-11-23 06:05:27,330 INFO L375 chiAutomizerObserver]: Analyzing ICFG array14_alloca_false-termination.c.i [2018-11-23 06:05:27,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:05:27,375 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:05:27,375 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:05:27,375 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:05:27,375 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:05:27,375 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:05:27,375 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:05:27,375 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:05:27,376 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:05:27,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 06:05:27,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:05:27,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:27,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:27,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:05:27,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:05:27,413 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:05:27,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 06:05:27,414 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:05:27,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:27,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:27,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:05:27,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:05:27,422 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-23 06:05:27,422 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-23 06:05:27,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 06:05:27,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:27,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:27,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-11-23 06:05:27,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:27,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:27,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:27,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-11-23 06:05:27,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:27,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:27,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:27,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:27,732 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:05:27,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:05:27,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:05:27,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:05:27,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:05:27,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:05:27,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:05:27,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:05:27,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 06:05:27,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:05:27,734 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:05:27,749 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-23 06:05:27,753 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-23 06:05:27,756 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-23 06:05:27,759 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-23 06:05:27,763 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-23 06:05:27,764 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-23 06:05:27,768 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-23 06:05:27,849 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-23 06:05:27,851 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-23 06:05:27,853 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-23 06:05:27,855 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-23 06:05:27,856 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-23 06:05:27,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:05:28,002 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:05:28,004 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-23 06:05:28,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,012 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-23 06:05:28,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,014 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-23 06:05:28,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,017 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-23 06:05:28,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,019 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-23 06:05:28,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,021 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-23 06:05:28,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:28,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,028 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-23 06:05:28,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:28,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:05:28,104 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 06:05:28,104 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 06:05:28,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:05:28,111 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:05:28,111 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:05:28,111 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-23 06:05:28,122 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:05:28,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:28,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:28,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:28,187 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-23 06:05:28,196 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-23 06:05:28,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-23 06:05:28,232 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-23 06:05:28,232 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-23 06:05:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:05:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 06:05:28,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 06:05:28,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:28,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 06:05:28,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:28,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 06:05:28,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:28,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-11-23 06:05:28,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:28,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-11-23 06:05:28,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 06:05:28,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 06:05:28,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-23 06:05:28,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:05:28,243 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-23 06:05:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-23 06:05:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 06:05:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 06:05:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-23 06:05:28,260 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-23 06:05:28,261 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-23 06:05:28,261 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:05:28,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-23 06:05:28,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:28,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:28,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:28,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:28,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:05:28,262 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-23 06:05:28,262 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-23 06:05:28,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-11-23 06:05:28,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:28,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:28,294 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-23 06:05:28,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:05:28,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:05:28,297 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:05:28,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-11-23 06:05:28,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:28,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:05:28,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:05:28,346 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 06:05:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:05:28,366 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-23 06:05:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:05:28,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-23 06:05:28,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:28,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 06:05:28,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 06:05:28,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 06:05:28,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-23 06:05:28,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:05:28,368 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 06:05:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-23 06:05:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-23 06:05:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 06:05:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-23 06:05:28,370 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 06:05:28,370 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 06:05:28,370 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:05:28,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-23 06:05:28,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:28,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:28,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:28,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:28,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:05:28,372 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-23 06:05:28,372 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-23 06:05:28,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-11-23 06:05:28,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:28,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:28,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-11-23 06:05:28,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:28,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-11-23 06:05:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:28,591 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:05:28,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:05:28,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:05:28,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:05:28,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:05:28,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:05:28,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:05:28,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:05:28,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca_false-termination.c.i_Iteration3_Lasso [2018-11-23 06:05:28,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:05:28,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:05:28,594 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-23 06:05:28,598 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-23 06:05:28,599 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-23 06:05:28,602 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-23 06:05:28,603 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-23 06:05:28,605 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-23 06:05:28,606 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-23 06:05:28,607 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-23 06:05:28,608 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-23 06:05:28,686 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-23 06:05:28,687 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-23 06:05:28,689 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-23 06:05:28,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:05:28,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:05:28,815 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-23 06:05:28,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,817 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-23 06:05:28,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,822 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-23 06:05:28,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:28,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,827 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-23 06:05:28,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,831 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-23 06:05:28,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:28,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,835 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-23 06:05:28,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,837 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-23 06:05:28,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,839 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-23 06:05:28,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:28,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:28,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:28,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,841 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-23 06:05:28,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:28,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,849 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-23 06:05:28,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,850 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:28,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,851 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:28,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:28,857 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-23 06:05:28,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:28,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:28,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:28,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:28,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:28,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:28,878 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:05:28,890 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 06:05:28,890 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:05:28,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:05:28,892 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 06:05:28,892 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:05:28,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 + 2*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~i~0 - 1 >= 0] [2018-11-23 06:05:28,902 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 06:05:28,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:28,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:28,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:28,965 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-23 06:05:28,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 06:05:28,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-23 06:05:29,006 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 18 states and 25 transitions. Complement of second has 7 states. [2018-11-23 06:05:29,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:05:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:05:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 06:05:29,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 06:05:29,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:29,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 06:05:29,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:29,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 06:05:29,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:29,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2018-11-23 06:05:29,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:29,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 06:05:29,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 06:05:29,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:05:29,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 06:05:29,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:29,011 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:05:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 06:05:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-23 06:05:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 06:05:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-23 06:05:29,012 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 06:05:29,012 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 06:05:29,012 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:05:29,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-23 06:05:29,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:29,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:29,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:29,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:29,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:05:29,013 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#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; 260#L367 assume !(main_~length~0 < 1); 271#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; 272#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 273#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); 261#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 262#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 274#L370-3 assume !(main_~i~0 < main_~length~0); 263#L370-4 main_~j~0 := 0; 264#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); 270#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; 266#L378-2 [2018-11-23 06:05:29,014 INFO L796 eck$LassoCheckResult]: Loop: 266#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); 267#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; 266#L378-2 [2018-11-23 06:05:29,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-11-23 06:05:29,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:29,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-11-23 06:05:29,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-11-23 06:05:29,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:29,088 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-23 06:05:29,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:05:29,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/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-23 06:05:29,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:29,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:29,131 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-23 06:05:29,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:05:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 06:05:29,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:05:29,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:05:29,163 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-23 06:05:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:05:29,237 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-11-23 06:05:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:05:29,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2018-11-23 06:05:29,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:29,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2018-11-23 06:05:29,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:05:29,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:05:29,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2018-11-23 06:05:29,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:29,239 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 06:05:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2018-11-23 06:05:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-23 06:05:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 06:05:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-23 06:05:29,240 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-23 06:05:29,241 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-23 06:05:29,241 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:05:29,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-23 06:05:29,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:29,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:29,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:29,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:29,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:05:29,242 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#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; 377#L367 assume !(main_~length~0 < 1); 386#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; 387#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 388#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); 391#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 389#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 390#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); 374#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 375#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L370-3 assume !(main_~i~0 < main_~length~0); 378#L370-4 main_~j~0 := 0; 379#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); 385#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; 381#L378-2 [2018-11-23 06:05:29,242 INFO L796 eck$LassoCheckResult]: Loop: 381#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); 382#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; 381#L378-2 [2018-11-23 06:05:29,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2018-11-23 06:05:29,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-11-23 06:05:29,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2018-11-23 06:05:29,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:29,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,460 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2018-11-23 06:05:29,491 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:05:29,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:05:29,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:05:29,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:05:29,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:05:29,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:05:29,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:05:29,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:05:29,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca_false-termination.c.i_Iteration5_Lasso [2018-11-23 06:05:29,492 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:05:29,492 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:05:29,494 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-23 06:05:29,499 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-23 06:05:29,569 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-23 06:05:29,571 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-23 06:05:29,572 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-23 06:05:29,574 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-23 06:05:29,575 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-23 06:05:29,576 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-23 06:05:29,577 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-23 06:05:29,579 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-23 06:05:29,581 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-23 06:05:29,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:05:29,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:05:29,709 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-23 06:05:29,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:29,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:29,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:29,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:29,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:29,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:29,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:29,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:29,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-23 06:05:29,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:29,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:29,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:29,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:29,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:29,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:29,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:29,715 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-23 06:05:29,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:29,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:29,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:29,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:29,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:29,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:29,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:29,718 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-23 06:05:29,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:29,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:29,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:29,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:29,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:29,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:29,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:29,721 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-23 06:05:29,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:29,721 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:29,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:29,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:29,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:29,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:29,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:29,732 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-23 06:05:29,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:29,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:29,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:29,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:29,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:29,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:29,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:05:29,768 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 06:05:29,768 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 06:05:29,768 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:05:29,769 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:05:29,769 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:05:29,769 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-23 06:05:29,792 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 06:05:29,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:29,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:29,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:29,834 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-23 06:05:29,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-23 06:05:29,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 06:05:29,861 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-23 06:05:29,862 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-23 06:05:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:05:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 06:05:29,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-23 06:05:29,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:29,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 06:05:29,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:29,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 06:05:29,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:29,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2018-11-23 06:05:29,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:29,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2018-11-23 06:05:29,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 06:05:29,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:05:29,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2018-11-23 06:05:29,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:29,865 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-23 06:05:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2018-11-23 06:05:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 06:05:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:05:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-11-23 06:05:29,867 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-23 06:05:29,867 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-23 06:05:29,867 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:05:29,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2018-11-23 06:05:29,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:05:29,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:29,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:29,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:29,868 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:05:29,868 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 506#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; 507#L367 assume !(main_~length~0 < 1); 516#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; 517#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 518#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); 522#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 519#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 520#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); 504#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 505#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 523#L370-3 assume !(main_~i~0 < main_~length~0); 508#L370-4 main_~j~0 := 0; 509#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); 515#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; 521#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); 524#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; 511#L378-2 [2018-11-23 06:05:29,868 INFO L796 eck$LassoCheckResult]: Loop: 511#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); 512#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; 511#L378-2 [2018-11-23 06:05:29,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2018-11-23 06:05:29,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-11-23 06:05:29,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:29,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:29,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2018-11-23 06:05:29,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:29,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:29,966 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-23 06:05:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:05:29,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b8c1442-71a5-4578-a254-25d16fc0b3a5/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-23 06:05:29,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:05:29,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:05:29,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:05:29,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:30,032 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-23 06:05:30,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:05:30,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 06:05:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:05:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:05:30,065 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-23 06:05:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:05:30,158 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-11-23 06:05:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:05:30,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2018-11-23 06:05:30,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 06:05:30,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2018-11-23 06:05:30,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 06:05:30,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 06:05:30,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2018-11-23 06:05:30,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:30,160 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-23 06:05:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2018-11-23 06:05:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-23 06:05:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:05:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-11-23 06:05:30,163 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-23 06:05:30,163 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-23 06:05:30,163 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:05:30,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2018-11-23 06:05:30,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:05:30,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:30,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:30,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:30,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 06:05:30,164 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 653#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; 654#L367 assume !(main_~length~0 < 1); 665#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; 666#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 667#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); 673#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 676#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 674#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); 675#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 668#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 669#L370-3 assume !(main_~i~0 < main_~length~0); 657#L370-4 main_~j~0 := 0; 658#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); 678#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; 677#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); 671#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; 672#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); 688#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; 686#L378-2 [2018-11-23 06:05:30,164 INFO L796 eck$LassoCheckResult]: Loop: 686#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); 683#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; 660#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); 661#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; 686#L378-2 [2018-11-23 06:05:30,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2018-11-23 06:05:30,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:30,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:30,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:30,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:30,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:30,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-11-23 06:05:30,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:30,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:30,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:30,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2018-11-23 06:05:30,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:30,470 WARN L180 SmtUtils]: Spent 199.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) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i 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) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i 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) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i 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) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i