./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array14_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_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array14_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/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 519b4f74907cdda12f126cdccb2c6422dda5240e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:55,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:55,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:55,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:55,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:55,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:55,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:55,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:55,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:55,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:55,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:55,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:55,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:55,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:55,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:55,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:55,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:55,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:55,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:55,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:55,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:55,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:55,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:55,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:55,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:55,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:55,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:55,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:55,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:55,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:55,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:55,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:55,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:55,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:55,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:55,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:55,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:55,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:55,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:55,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:55,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:55,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:55,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:55,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:55,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:55,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:55,567 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:55,567 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:55,567 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:55,567 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:55,567 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:55,568 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:55,568 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:55,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:55,568 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:55,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:55,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:55,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:55,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:55,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:55,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:55,570 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:55,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:55,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:55,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:55,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:55,570 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:55,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:55,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:55,571 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:55,572 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:55,572 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_c2db7337-1d7c-4692-aca2-3170398de1ba/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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2019-10-22 09:00:55,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:55,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:55,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:55,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:55,623 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:55,623 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/../../sv-benchmarks/c/termination-15/array14_alloca.i [2019-10-22 09:00:55,678 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/data/e3c01c117/8ee5ebea8d8d4f5ab1197e8162a3b0e6/FLAG95c3dd5f5 [2019-10-22 09:00:56,113 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:56,113 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/sv-benchmarks/c/termination-15/array14_alloca.i [2019-10-22 09:00:56,119 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/data/e3c01c117/8ee5ebea8d8d4f5ab1197e8162a3b0e6/FLAG95c3dd5f5 [2019-10-22 09:00:56,130 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/data/e3c01c117/8ee5ebea8d8d4f5ab1197e8162a3b0e6 [2019-10-22 09:00:56,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:56,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:56,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:56,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:56,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:56,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30031fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56, skipping insertion in model container [2019-10-22 09:00:56,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,151 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:56,185 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:56,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:56,581 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:56,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:56,694 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:56,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56 WrapperNode [2019-10-22 09:00:56,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:56,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:56,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:56,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:56,704 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:00:56" (1/1) ... [2019-10-22 09:00:56,716 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:00:56" (1/1) ... [2019-10-22 09:00:56,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:56,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:56,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:56,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:56,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:56,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:56,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:56,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:56,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/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:00:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:56,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:56,972 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:56,972 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 09:00:56,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:56 BoogieIcfgContainer [2019-10-22 09:00:56,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:56,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:56,974 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:56,977 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:56,978 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:56,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:56" (1/3) ... [2019-10-22 09:00:56,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c9fa9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:56, skipping insertion in model container [2019-10-22 09:00:56,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:56,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (2/3) ... [2019-10-22 09:00:56,980 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c9fa9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:56, skipping insertion in model container [2019-10-22 09:00:56,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:56,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:56" (3/3) ... [2019-10-22 09:00:56,981 INFO L371 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2019-10-22 09:00:57,025 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:57,025 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:57,025 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:57,025 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:57,025 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:57,025 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:57,025 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:57,026 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:57,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 09:00:57,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 09:00:57,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:57,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:57,069 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:57,070 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:57,070 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:57,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 09:00:57,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 09:00:57,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:57,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:57,072 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:57,072 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:57,080 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.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; 17#L370-3true [2019-10-22 09:00:57,080 INFO L793 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-10-22 09:00:57,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,088 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 09:00:57,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860380014] [2019-10-22 09:00:57,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,221 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-10-22 09:00:57,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108328897] [2019-10-22 09:00:57,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,244 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-10-22 09:00:57,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516274710] [2019-10-22 09:00:57,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:57,534 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-10-22 09:00:57,590 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:57,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:57,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:57,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:57,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:57,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:57,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:57,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:57,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2019-10-22 09:00:57,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:57,592 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:57,616 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:00:57,622 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:00:57,624 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:00:57,628 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:00:57,630 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:00:57,636 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:00:57,641 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:00:57,644 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:00:57,647 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:00:57,651 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:00:57,754 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:00:57,757 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:00:57,975 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:57,979 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:57,981 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:00:57,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,989 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:00:57,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,992 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:00:57,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,993 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,998 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:00:57,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,001 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:00:58,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,008 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,008 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,013 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:00:58,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,021 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:00:58,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,023 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:00:58,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,025 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,042 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:00:58,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,048 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:00:58,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,120 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:58,146 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:58,146 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:58,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:58,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:58,150 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:58,151 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 09:00:58,159 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:00:58,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:58,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:58,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:58,237 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:00:58,251 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:00:58,253 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-10-22 09:00:58,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-10-22 09:00:58,309 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:00:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-10-22 09:00:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 09:00:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 09:00:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 09:00:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:58,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-10-22 09:00:58,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:58,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-10-22 09:00:58,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 09:00:58,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:00:58,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-10-22 09:00:58,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:58,326 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-10-22 09:00:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-10-22 09:00:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 09:00:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:00:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-10-22 09:00:58,349 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-10-22 09:00:58,349 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-10-22 09:00:58,349 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:58,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-10-22 09:00:58,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:58,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:58,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:58,350 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,350 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:58,351 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-10-22 09:00:58,351 INFO L793 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2019-10-22 09:00:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-10-22 09:00:58,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560339626] [2019-10-22 09:00:58,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,394 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:00:58,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560339626] [2019-10-22 09:00:58,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:58,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272251648] [2019-10-22 09:00:58,397 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-10-22 09:00:58,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486889171] [2019-10-22 09:00:58,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,406 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:58,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:58,443 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:00:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,470 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-10-22 09:00:58,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:58,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-10-22 09:00:58,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:58,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 09:00:58,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:00:58,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:00:58,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 09:00:58,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:58,472 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 09:00:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 09:00:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-10-22 09:00:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:00:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 09:00:58,474 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:00:58,474 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:00:58,474 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:58,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 09:00:58,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:58,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:58,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:58,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,476 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:58,476 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-10-22 09:00:58,476 INFO L793 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2019-10-22 09:00:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-10-22 09:00:58,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699822517] [2019-10-22 09:00:58,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,496 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-10-22 09:00:58,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631320099] [2019-10-22 09:00:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,504 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-10-22 09:00:58,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745004792] [2019-10-22 09:00:58,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:58,534 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:58,714 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-22 09:00:58,774 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:58,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:58,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:58,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:58,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:58,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:58,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:58,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:58,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2019-10-22 09:00:58,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:58,775 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:58,780 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:00:58,784 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:00:58,786 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:00:58,902 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:00:58,905 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:00:58,907 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:00:58,909 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:00:58,911 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:00:58,913 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:00:58,915 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:00:58,917 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:00:58,920 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:00:59,146 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:59,146 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:59,147 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:00:59,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:59,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:59,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:59,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:59,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:59,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:59,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:59,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:59,149 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:00:59,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:59,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:59,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:59,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:59,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:59,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:59,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:59,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:59,152 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:00:59,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:59,153 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:59,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:59,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:59,155 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:59,155 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:59,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:59,164 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:00:59,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:59,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:59,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:59,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:59,166 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:59,167 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:59,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:59,169 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:00:59,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:59,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:59,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:59,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:59,172 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:59,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:59,197 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:59,236 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:59,236 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:59,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:59,238 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:59,242 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:59,243 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-10-22 09:00:59,254 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:00:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:59,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:59,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:59,300 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:00:59,301 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:00:59,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:00:59,313 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-10-22 09:00:59,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 09:00:59,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 09:00:59,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:59,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 09:00:59,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:59,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 09:00:59,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:59,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-10-22 09:00:59,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:59,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 09:00:59,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:00:59,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:59,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-10-22 09:00:59,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:59,317 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 09:00:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-10-22 09:00:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:00:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:00:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 09:00:59,318 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 09:00:59,318 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 09:00:59,318 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:59,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-10-22 09:00:59,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:59,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:59,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:59,320 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,320 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:59,320 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2019-10-22 09:00:59,320 INFO L793 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2019-10-22 09:00:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-10-22 09:00:59,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392944765] [2019-10-22 09:00:59,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,349 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-10-22 09:00:59,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052377739] [2019-10-22 09:00:59,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-10-22 09:00:59,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388812018] [2019-10-22 09:00:59,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:59,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388812018] [2019-10-22 09:00:59,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130754474] [2019-10-22 09:00:59,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/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:00:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:59,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:59,564 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:59,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-22 09:00:59,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676964599] [2019-10-22 09:00:59,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 09:00:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:00:59,599 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 09:00:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,780 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-10-22 09:00:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:00:59,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-10-22 09:00:59,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:59,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-10-22 09:00:59,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:59,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:59,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-10-22 09:00:59,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:59,782 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 09:00:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-10-22 09:00:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-10-22 09:00:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-10-22 09:00:59,784 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:00:59,784 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:00:59,784 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:59,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-10-22 09:00:59,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:59,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:59,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:59,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:59,785 INFO L791 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 360#L367 assume !(main_~length~0 < 1); 369#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; 370#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 371#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 374#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 372#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 373#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); 357#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 358#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 375#L370-3 assume !(main_~i~0 < main_~length~0); 361#L370-4 main_~j~0 := 0; 362#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 368#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 364#L378-2 [2019-10-22 09:00:59,785 INFO L793 eck$LassoCheckResult]: Loop: 364#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 365#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 364#L378-2 [2019-10-22 09:00:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-10-22 09:00:59,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082487998] [2019-10-22 09:00:59,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-10-22 09:00:59,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039789225] [2019-10-22 09:00:59,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-10-22 09:00:59,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119017867] [2019-10-22 09:00:59,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,855 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:00,074 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-10-22 09:01:00,120 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:00,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:00,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:00,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:00,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:00,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:00,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:00,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:00,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2019-10-22 09:01:00,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:00,121 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:00,123 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:00,130 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:00,132 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:00,134 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:00,285 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:00,287 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:00,290 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:00,292 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:00,293 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:00,295 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:00,296 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:00,498 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:00,498 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:00,499 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:00,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:00,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,500 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:00,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:00,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,501 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:00,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,504 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,506 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:00,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,507 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:00,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,507 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:00,507 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:00,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,508 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:00,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,511 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,511 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,518 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:00,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,523 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,523 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,547 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:00,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:00,561 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:01:00,566 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:00,567 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:00,567 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:00,567 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-10-22 09:01:00,574 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:01:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:00,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:00,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:00,619 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:00,619 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:00,620 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:01:00,633 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2019-10-22 09:01:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:01:00,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:01:00,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:00,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:01:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:00,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:01:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:00,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-10-22 09:01:00,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:00,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-10-22 09:01:00,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:00,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:01:00,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-10-22 09:01:00,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:00,637 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-22 09:01:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-10-22 09:01:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 09:01:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:01:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-22 09:01:00,644 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-22 09:01:00,644 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-22 09:01:00,644 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:00,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-10-22 09:01:00,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:00,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:00,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:00,645 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:00,645 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:00,645 INFO L791 eck$LassoCheckResult]: Stem: 493#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 487#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 488#L367 assume !(main_~length~0 < 1); 499#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; 500#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 501#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); 505#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 502#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 503#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); 489#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 490#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 506#L370-3 assume !(main_~i~0 < main_~length~0); 491#L370-4 main_~j~0 := 0; 492#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 497#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 504#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 507#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 494#L378-2 [2019-10-22 09:01:00,645 INFO L793 eck$LassoCheckResult]: Loop: 494#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 495#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 494#L378-2 [2019-10-22 09:01:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-10-22 09:01:00,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930836478] [2019-10-22 09:01:00,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:00,683 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-10-22 09:01:00,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139833113] [2019-10-22 09:01:00,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:00,693 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-10-22 09:01:00,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900305175] [2019-10-22 09:01:00,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:00,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900305175] [2019-10-22 09:01:00,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674908466] [2019-10-22 09:01:00,812 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/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:00,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 09:01:00,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:00,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:00,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:00,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:00,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-10-22 09:01:00,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291589500] [2019-10-22 09:01:00,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 09:01:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:01:00,953 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-10-22 09:01:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,140 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-10-22 09:01:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:01:01,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-10-22 09:01:01,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:01:01,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-10-22 09:01:01,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 09:01:01,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 09:01:01,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-10-22 09:01:01,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:01,143 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-10-22 09:01:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-10-22 09:01:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-10-22 09:01:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 09:01:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-10-22 09:01:01,147 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-10-22 09:01:01,147 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-10-22 09:01:01,147 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:01,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-10-22 09:01:01,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:01:01,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:01,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:01,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-10-22 09:01:01,149 INFO L791 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 641#L367 assume !(main_~length~0 < 1); 652#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; 653#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 654#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 659#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 662#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 660#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); 661#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 655#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 656#L370-3 assume !(main_~i~0 < main_~length~0); 644#L370-4 main_~j~0 := 0; 645#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 664#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 663#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 657#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 658#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 674#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 672#L378-2 [2019-10-22 09:01:01,149 INFO L793 eck$LassoCheckResult]: Loop: 672#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 669#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 670#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 675#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 672#L378-2 [2019-10-22 09:01:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-10-22 09:01:01,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177637612] [2019-10-22 09:01:01,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,168 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-10-22 09:01:01,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333423930] [2019-10-22 09:01:01,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-10-22 09:01:01,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565470665] [2019-10-22 09:01:01,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,206 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,519 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 106 [2019-10-22 09:01:01,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:01 BoogieIcfgContainer [2019-10-22 09:01:01,589 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:01,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:01,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:01,589 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:01,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:56" (3/4) ... [2019-10-22 09:01:01,592 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:01,634 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c2db7337-1d7c-4692-aca2-3170398de1ba/bin/uautomizer/witness.graphml [2019-10-22 09:01:01,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:01,635 INFO L168 Benchmark]: Toolchain (without parser) took 5502.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 939.3 MB in the beginning and 956.2 MB in the end (delta: -16.9 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:01,636 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:01,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:01,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:01,637 INFO L168 Benchmark]: Boogie Preprocessor took 22.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:01,637 INFO L168 Benchmark]: RCFGBuilder took 218.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:01,638 INFO L168 Benchmark]: BuchiAutomizer took 4614.60 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 958.3 MB in the end (delta: 114.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:01,639 INFO L168 Benchmark]: Witness Printer took 45.14 ms. Allocated memory is still 1.2 GB. Free memory was 958.3 MB in the beginning and 956.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:01,641 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 218.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4614.60 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 958.3 MB in the end (delta: 114.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. * Witness Printer took 45.14 ms. Allocated memory is still 1.2 GB. Free memory was 958.3 MB in the beginning and 956.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * i and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 64 SDtfs, 166 SDslu, 76 SDs, 0 SdLazy, 215 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf98 lsp93 ukn83 mio100 lsp61 div100 bol100 ite100 ukn100 eq163 hnf89 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {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@15829b12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20310524=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c5f3039=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@619bd51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c5f3039=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5f71579e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@4af18e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3f7c6315=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1e952ef9=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 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i