./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array19_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_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/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 1ea3ac03f270ffde8f9fa6679f30ddad451a463f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:56:08,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:56:08,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:56:08,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:56:08,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:56:08,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:56:08,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:56:08,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:56:08,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:56:08,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:56:08,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:56:08,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:56:08,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:56:08,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:56:08,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:56:08,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:56:08,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:56:08,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:56:08,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:56:08,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:56:08,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:56:08,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:56:08,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:56:08,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:56:08,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:56:08,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:56:08,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:56:08,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:56:08,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:56:08,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:56:08,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:56:08,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:56:08,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:56:08,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:56:08,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:56:08,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:56:08,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:56:08,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:56:08,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:56:08,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:56:08,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:56:08,695 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:56:08,695 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:56:08,695 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:56:08,696 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:56:08,696 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:56:08,696 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:56:08,696 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:56:08,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:56:08,696 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:56:08,697 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:56:08,698 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:56:08,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:56:08,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:56:08,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:56:08,698 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:56:08,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:56:08,699 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:56:08,699 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:56:08,700 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:56:08,700 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_f2d5d948-74f2-4d4b-92f3-92f5669332e4/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 -> 1ea3ac03f270ffde8f9fa6679f30ddad451a463f [2018-11-22 22:56:08,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:56:08,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:56:08,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:56:08,736 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:56:08,736 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:56:08,737 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i [2018-11-22 22:56:08,774 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/data/7a9ffce02/9330124dc34347ec96ec0e1616aee5e6/FLAGb08aa69f2 [2018-11-22 22:56:09,200 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:56:09,201 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i [2018-11-22 22:56:09,207 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/data/7a9ffce02/9330124dc34347ec96ec0e1616aee5e6/FLAGb08aa69f2 [2018-11-22 22:56:09,216 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/data/7a9ffce02/9330124dc34347ec96ec0e1616aee5e6 [2018-11-22 22:56:09,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:56:09,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:56:09,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:56:09,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:56:09,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:56:09,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172b0922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09, skipping insertion in model container [2018-11-22 22:56:09,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:56:09,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:56:09,474 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:56:09,482 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:56:09,559 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:56:09,602 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:56:09,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09 WrapperNode [2018-11-22 22:56:09,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:56:09,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:56:09,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:56:09,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:56:09,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:56:09,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:56:09,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:56:09,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:56:09,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... [2018-11-22 22:56:09,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:56:09,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:56:09,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:56:09,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:56:09,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2d5d948-74f2-4d4b-92f3-92f5669332e4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:56:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:56:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:56:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:56:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:56:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:56:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:56:09,853 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:56:09,853 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-22 22:56:09,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:09 BoogieIcfgContainer [2018-11-22 22:56:09,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:56:09,854 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:56:09,854 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:56:09,858 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:56:09,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:56:09,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:56:09" (1/3) ... [2018-11-22 22:56:09,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f30d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:56:09, skipping insertion in model container [2018-11-22 22:56:09,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:56:09,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:09" (2/3) ... [2018-11-22 22:56:09,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f30d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:56:09, skipping insertion in model container [2018-11-22 22:56:09,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:56:09,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:09" (3/3) ... [2018-11-22 22:56:09,862 INFO L375 chiAutomizerObserver]: Analyzing ICFG array19_alloca_false-termination.c.i [2018-11-22 22:56:09,910 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:56:09,911 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:56:09,911 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:56:09,911 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:56:09,911 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:56:09,911 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:56:09,911 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:56:09,911 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:56:09,912 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:56:09,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-22 22:56:09,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-22 22:56:09,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:56:09,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:56:09,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:56:09,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:56:09,949 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:56:09,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-22 22:56:09,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-22 22:56:09,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:56:09,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:56:09,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:56:09,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:56:09,958 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 14#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; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2018-11-22 22:56:09,958 INFO L796 eck$LassoCheckResult]: Loop: 15#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; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2018-11-22 22:56:09,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-22 22:56:09,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-11-22 22:56:10,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-11-22 22:56:10,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,254 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:56:10,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:56:10,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:56:10,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:56:10,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:56:10,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:56:10,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:56:10,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:56:10,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: array19_alloca_false-termination.c.i_Iteration1_Lasso [2018-11-22 22:56:10,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:56:10,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:56:10,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:56:10,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:56:10,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:56:10,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:56:10,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:56:10,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:56:10,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:56:10,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:56:10,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:56:10,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:56:10,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:56:10,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:56:10,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:56:10,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:56:10,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:56:10,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:56:10,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:56:10,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:56:10,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:56:10,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:56:10,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:56:10,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:56:10,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:56:10,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:56:10,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:56:10,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:56:10,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:56:10,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:56:10,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:56:10,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:56:10,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:56:10,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:56:10,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:56:10,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:56:10,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:56:10,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:56:10,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:56:10,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:56:10,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:56:10,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:56:10,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:56:10,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:56:10,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:56:10,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:56:10,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:56:10,570 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:56:10,588 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:56:10,588 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:56:10,589 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:56:10,590 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:56:10,591 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:56:10,591 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-22 22:56:10,606 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:56:10,614 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:56:10,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:56:10,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:56:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:56:10,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:56:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:56:10,682 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:56:10,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-11-22 22:56:10,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2018-11-22 22:56:10,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 22:56:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:56:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-22 22:56:10,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-22 22:56:10,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:56:10,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-22 22:56:10,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:56:10,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:56:10,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:56:10,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-22 22:56:10,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 22:56:10,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2018-11-22 22:56:10,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-22 22:56:10,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-22 22:56:10,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-22 22:56:10,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:56:10,725 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:56:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-22 22:56:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-22 22:56:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:56:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-22 22:56:10,744 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:56:10,744 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:56:10,744 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:56:10,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-22 22:56:10,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 22:56:10,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:56:10,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:56:10,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:56:10,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-22 22:56:10,746 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 105#L367 assume !(main_~length~0 < 1); 108#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; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2018-11-22 22:56:10,746 INFO L796 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 + (1 + main_#t~mem209);havoc main_#t~mem209; 103#L374-2 [2018-11-22 22:56:10,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-11-22 22:56:10,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:56:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:56:10,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:56:10,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:56:10,778 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:56:10,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2018-11-22 22:56:10,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:56:10,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:56:10,812 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-22 22:56:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:56:10,831 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-22 22:56:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:56:10,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-22 22:56:10,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 22:56:10,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-22 22:56:10,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-22 22:56:10,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-22 22:56:10,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-22 22:56:10,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:56:10,834 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-22 22:56:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-22 22:56:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-22 22:56:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:56:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-22 22:56:10,835 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-22 22:56:10,835 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-22 22:56:10,835 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:56:10,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-22 22:56:10,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 22:56:10,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:56:10,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:56:10,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:56:10,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-22 22:56:10,837 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 133#L367 assume !(main_~length~0 < 1); 136#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; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#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; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2018-11-22 22:56:10,837 INFO L796 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 + (1 + main_#t~mem209);havoc main_#t~mem209; 131#L374-2 [2018-11-22 22:56:10,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2018-11-22 22:56:10,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2018-11-22 22:56:10,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:56:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:56:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2018-11-22 22:56:10,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:56:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:56:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:56:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:56:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:56:11,010 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 ----- 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~post207, main_#t~mem209, 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; [?] 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; [?] #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~post207, main_#t~mem209, 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-L372] 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; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L372] assume !(main_~i~0 < main_~length~0); [L373] main_~j~0 := 0; ----- ----- 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~post207, main_#t~mem209, 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-L372] 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; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L372] assume !(main_~i~0 < main_~length~0); [L373] main_~j~0 := 0; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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-L372] 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; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L372] COND TRUE !(main_~i~0 < main_~length~0) [L373] main_~j~0 := 0; ----- ----- 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~post207, main_#t~mem209, 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-L372] 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; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L372] COND TRUE !(main_~i~0 < main_~length~0) [L373] main_~j~0 := 0; [?] #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-L372] 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; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L372] COND TRUE !(~i~0 < ~length~0) [L373] ~j~0 := 0; ----- ----- 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-L372] 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; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L372] COND TRUE !(~i~0 < ~length~0) [L373] ~j~0 := 0; [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