./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array20_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array20_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/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 15cc26ae0dc42c909592f114b7003fa240a2d07d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-10-22 09:01:44,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:44,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:44,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:44,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:44,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:44,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:44,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:44,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:44,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:44,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:44,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:44,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:44,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:44,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:44,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:44,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:44,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:44,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:44,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:44,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:44,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:44,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:44,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:44,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:44,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:44,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:44,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:44,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:44,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:44,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:44,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:44,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:44,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:44,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:44,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:44,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:44,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:44,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:44,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:44,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:44,609 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:44,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:44,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:44,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:44,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:44,625 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:44,625 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:44,625 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:44,625 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:44,625 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:44,625 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:44,626 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:44,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:44,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:44,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:44,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:44,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:44,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:44,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:44,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:44,637 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:44,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:44,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:44,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:44,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:44,638 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:44,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:44,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:44,638 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:44,639 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:44,639 INFO L138 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_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/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 -> 15cc26ae0dc42c909592f114b7003fa240a2d07d [2019-10-22 09:01:44,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:44,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:44,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:44,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:44,684 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:44,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/../../sv-benchmarks/c/termination-15/array20_alloca.i [2019-10-22 09:01:44,735 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/data/f5e0cec70/5b27a8e8850241449383171f775c95fa/FLAG7f3a15aee [2019-10-22 09:01:45,215 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:45,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/sv-benchmarks/c/termination-15/array20_alloca.i [2019-10-22 09:01:45,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/data/f5e0cec70/5b27a8e8850241449383171f775c95fa/FLAG7f3a15aee [2019-10-22 09:01:45,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/data/f5e0cec70/5b27a8e8850241449383171f775c95fa [2019-10-22 09:01:45,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:45,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:45,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:45,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:45,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:45,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6072a6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45, skipping insertion in model container [2019-10-22 09:01:45,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,735 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:45,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:46,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:46,189 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:46,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:46,280 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:46,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46 WrapperNode [2019-10-22 09:01:46,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:46,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:46,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:46,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:46,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:46,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:46,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:46,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:46,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... [2019-10-22 09:01:46,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:46,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:46,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:46,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:46,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/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 [2019-10-22 09:01:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:46,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:46,565 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 09:01:46,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46 BoogieIcfgContainer [2019-10-22 09:01:46,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:46,567 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:46,567 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:46,570 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:46,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:46,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:45" (1/3) ... [2019-10-22 09:01:46,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4553cf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:46, skipping insertion in model container [2019-10-22 09:01:46,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:46,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:46" (2/3) ... [2019-10-22 09:01:46,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4553cf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:46, skipping insertion in model container [2019-10-22 09:01:46,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:46,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46" (3/3) ... [2019-10-22 09:01:46,583 INFO L371 chiAutomizerObserver]: Analyzing ICFG array20_alloca.i [2019-10-22 09:01:46,655 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:46,666 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:46,667 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:46,667 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:46,667 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:46,667 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:46,667 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:46,667 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:46,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:01:46,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:01:46,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:46,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:46,751 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:46,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:01:46,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:01:46,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,753 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:46,753 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:46,761 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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_~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; 15#L367true assume !(main_~length~0 < 1); 4#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(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; 16#L370-3true [2019-10-22 09:01:46,761 INFO L793 eck$LassoCheckResult]: Loop: 16#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); 8#L372true assume main_#t~mem209 < 1;havoc main_#t~mem209;call write~int(1, 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; 16#L370-3true [2019-10-22 09:01:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 09:01:46,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640698508] [2019-10-22 09:01:46,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-10-22 09:01:46,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940605388] [2019-10-22 09:01:46,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-10-22 09:01:46,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208365611] [2019-10-22 09:01:46,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,164 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:47,165 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:47,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:47,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:47,165 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:47,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:47,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:47,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: array20_alloca.i_Iteration1_Lasso [2019-10-22 09:01:47,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:47,166 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:47,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,529 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:47,531 INFO L120 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 [2019-10-22 09:01:47,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,540 INFO L120 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 [2019-10-22 09:01:47,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,544 INFO L120 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 [2019-10-22 09:01:47,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,545 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,546 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,546 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,547 INFO L120 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 [2019-10-22 09:01:47,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,551 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:47,551 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:47,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,556 INFO L120 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 [2019-10-22 09:01:47,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,560 INFO L120 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 [2019-10-22 09:01:47,560 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,563 INFO L120 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 [2019-10-22 09:01:47,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:47,566 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:47,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,570 INFO L120 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 [2019-10-22 09:01:47,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,571 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:47,576 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:47,639 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:47,716 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:47,721 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:01:47,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:47,725 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:47,726 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:47,726 INFO L512 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 [] [2019-10-22 09:01:47,744 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:01:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,854 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 [2019-10-22 09:01:47,855 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-10-22 09:01:47,918 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 32 states and 44 transitions. Complement of second has 7 states. [2019-10-22 09:01:47,919 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 [2019-10-22 09:01:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-10-22 09:01:47,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 09:01:47,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 09:01:47,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 09:01:47,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2019-10-22 09:01:47,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:47,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 11 states and 15 transitions. [2019-10-22 09:01:47,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 09:01:47,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 09:01:47,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-10-22 09:01:47,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:47,941 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 09:01:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-10-22 09:01:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 09:01:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 09:01:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-10-22 09:01:47,970 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 09:01:47,970 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 09:01:47,970 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:47,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-10-22 09:01:47,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:47,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:47,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:47,973 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,973 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 09:01:47,973 INFO L791 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#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_~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; 110#L367 assume !(main_~length~0 < 1); 116#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 117#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 118#L370-3 assume !(main_~i~0 < main_~length~0); 113#L370-4 main_~j~0 := 1; 114#L377-2 [2019-10-22 09:01:47,974 INFO L793 eck$LassoCheckResult]: Loop: 114#L377-2 assume !!(1 <= 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);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 114#L377-2 [2019-10-22 09:01:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-10-22 09:01:47,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073953885] [2019-10-22 09:01:47,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073953885] [2019-10-22 09:01:48,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:48,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:48,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504184475] [2019-10-22 09:01:48,022 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2019-10-22 09:01:48,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168422916] [2019-10-22 09:01:48,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,029 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:01:48,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325088988] [2019-10-22 09:01:48,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,074 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:48,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:48,124 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 09:01:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,165 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-10-22 09:01:48,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:48,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-10-22 09:01:48,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:48,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 09:01:48,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 09:01:48,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 09:01:48,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 09:01:48,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:48,172 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 09:01:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 09:01:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-10-22 09:01:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 09:01:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-10-22 09:01:48,173 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 09:01:48,173 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 09:01:48,173 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:48,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-10-22 09:01:48,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:48,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:48,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:48,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 09:01:48,176 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#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_~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; 141#L367 assume !(main_~length~0 < 1); 147#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 148#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 149#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); 142#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 143#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 150#L370-3 assume !(main_~i~0 < main_~length~0); 144#L370-4 main_~j~0 := 1; 145#L377-2 [2019-10-22 09:01:48,176 INFO L793 eck$LassoCheckResult]: Loop: 145#L377-2 assume !!(1 <= 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);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 145#L377-2 [2019-10-22 09:01:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-10-22 09:01:48,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953334838] [2019-10-22 09:01:48,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,201 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2019-10-22 09:01:48,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153991641] [2019-10-22 09:01:48,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,205 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:01:48,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61433401] [2019-10-22 09:01:48,205 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:48,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:48,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 09:01:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,243 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1329989554, now seen corresponding path program 1 times [2019-10-22 09:01:48,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150271940] [2019-10-22 09:01:48,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,252 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:01:48,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291801864] [2019-10-22 09:01:48,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150271940] [2019-10-22 09:01:48,339 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:01:48,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291801864] [2019-10-22 09:01:48,339 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:48,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-10-22 09:01:48,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53468799] [2019-10-22 09:01:48,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:48,448 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 09:01:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,537 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-10-22 09:01:48,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:48,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-10-22 09:01:48,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:48,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 20 transitions. [2019-10-22 09:01:48,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 09:01:48,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 09:01:48,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-10-22 09:01:48,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:48,540 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:01:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-10-22 09:01:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-10-22 09:01:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 09:01:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-10-22 09:01:48,542 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 09:01:48,542 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 09:01:48,542 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:48,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-10-22 09:01:48,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:48,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:48,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:48,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 09:01:48,544 INFO L791 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#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_~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; 223#L367 assume !(main_~length~0 < 1); 229#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 230#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 231#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); 233#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 235#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 234#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); 224#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 225#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 232#L370-3 assume !(main_~i~0 < main_~length~0); 226#L370-4 main_~j~0 := 1; 227#L377-2 [2019-10-22 09:01:48,544 INFO L793 eck$LassoCheckResult]: Loop: 227#L377-2 assume !!(1 <= 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);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 227#L377-2 [2019-10-22 09:01:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1781949270, now seen corresponding path program 2 times [2019-10-22 09:01:48,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295634739] [2019-10-22 09:01:48,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2019-10-22 09:01:48,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630163126] [2019-10-22 09:01:48,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,593 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:01:48,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085664746] [2019-10-22 09:01:48,593 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:48,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-22 09:01:48,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 09:01:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,638 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -594147436, now seen corresponding path program 2 times [2019-10-22 09:01:48,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133849313] [2019-10-22 09:01:48,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,650 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:01:48,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673810180] [2019-10-22 09:01:48,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:48,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:01:48,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 09:01:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,951 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-10-22 09:01:49,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:49 BoogieIcfgContainer [2019-10-22 09:01:49,034 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:49,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:49,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:49,035 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:49,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:46" (3/4) ... [2019-10-22 09:01:49,045 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:49,086 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_55fcb31f-a3fc-4587-8340-f5f9c64a4593/bin/uautomizer/witness.graphml [2019-10-22 09:01:49,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:49,088 INFO L168 Benchmark]: Toolchain (without parser) took 3369.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 813.5 MB in the end (delta: 131.1 MB). Peak memory consumption was 270.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,088 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:49,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,089 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:49,089 INFO L168 Benchmark]: RCFGBuilder took 222.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,089 INFO L168 Benchmark]: BuchiAutomizer took 2467.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 817.1 MB in the end (delta: 270.3 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,090 INFO L168 Benchmark]: Witness Printer took 52.03 ms. Allocated memory is still 1.2 GB. Free memory was 817.1 MB in the beginning and 813.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,096 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2467.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 817.1 MB in the end (delta: 270.3 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. * Witness Printer took 52.03 ms. Allocated memory is still 1.2 GB. Free memory was 817.1 MB in the beginning and 813.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 56 SDslu, 26 SDs, 0 SdLazy, 58 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital104 mio100 ax100 hnf99 lsp91 ukn82 mio100 lsp64 div100 bol100 ite100 ukn100 eq167 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31a2d3fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17a43caa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bd614ff=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@447cfa40=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bd614ff=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@71af6120=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6f679516=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i