./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:17:18,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:17:18,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:17:18,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:17:18,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:17:18,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:17:18,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:17:18,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:17:18,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:17:18,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:17:18,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:17:18,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:17:18,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:17:18,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:17:18,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:17:18,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:17:18,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:17:18,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:17:18,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:17:18,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:17:18,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:17:18,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:17:18,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:17:18,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:17:18,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:17:18,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:17:18,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:17:18,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:17:18,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:17:18,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:17:18,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:17:18,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:17:18,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:17:18,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:17:18,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:17:18,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:17:18,563 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 08:17:18,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:17:18,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:17:18,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:17:18,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:17:18,575 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 08:17:18,575 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 08:17:18,575 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 08:17:18,575 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 08:17:18,575 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 08:17:18,575 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 08:17:18,575 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 08:17:18,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 08:17:18,576 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:17:18,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 08:17:18,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:17:18,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:17:18,577 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 08:17:18,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:17:18,577 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 08:17:18,577 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 08:17:18,578 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 08:17:18,578 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2018-12-09 08:17:18,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:17:18,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:17:18,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:17:18,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:17:18,613 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:17:18,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-12-09 08:17:18,655 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/data/87dc4dca1/8c5c247f2468432a8020edcf48aff5ca/FLAG602f15cea [2018-12-09 08:17:19,066 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:17:19,066 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-12-09 08:17:19,071 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/data/87dc4dca1/8c5c247f2468432a8020edcf48aff5ca/FLAG602f15cea [2018-12-09 08:17:19,079 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/data/87dc4dca1/8c5c247f2468432a8020edcf48aff5ca [2018-12-09 08:17:19,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:17:19,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:17:19,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:17:19,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:17:19,085 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:17:19,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513beff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19, skipping insertion in model container [2018-12-09 08:17:19,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:17:19,107 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:17:19,254 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:17:19,260 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:17:19,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:17:19,355 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:17:19,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19 WrapperNode [2018-12-09 08:17:19,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:17:19,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:17:19,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:17:19,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:17:19,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:17:19,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:17:19,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:17:19,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:17:19,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... [2018-12-09 08:17:19,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:17:19,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:17:19,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:17:19,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:17:19,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:17:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:17:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:17:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:17:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:17:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:17:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:17:19,531 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:17:19,531 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 08:17:19,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:17:19 BoogieIcfgContainer [2018-12-09 08:17:19,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:17:19,532 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 08:17:19,532 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 08:17:19,534 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 08:17:19,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:17:19,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 08:17:19" (1/3) ... [2018-12-09 08:17:19,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3010e91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:17:19, skipping insertion in model container [2018-12-09 08:17:19,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:17:19,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:17:19" (2/3) ... [2018-12-09 08:17:19,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3010e91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:17:19, skipping insertion in model container [2018-12-09 08:17:19,536 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:17:19,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:17:19" (3/3) ... [2018-12-09 08:17:19,537 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2018-12-09 08:17:19,567 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:17:19,567 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 08:17:19,567 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 08:17:19,567 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 08:17:19,568 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:17:19,568 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:17:19,568 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 08:17:19,568 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:17:19,568 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 08:17:19,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 08:17:19,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 08:17:19,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:19,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:19,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 08:17:19,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:17:19,592 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 08:17:19,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 08:17:19,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 08:17:19,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:19,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:19,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 08:17:19,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:17:19,599 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2018-12-09 08:17:19,600 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2018-12-09 08:17:19,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-09 08:17:19,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:19,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:19,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:19,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-12-09 08:17:19,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:19,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:19,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:19,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-12-09 08:17:19,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:19,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:19,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:19,875 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:17:19,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:17:19,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:17:19,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:17:19,876 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:17:19,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:17:19,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:17:19,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:17:19,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2018-12-09 08:17:19,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:17:19,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:17:19,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:19,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,095 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:17:20,098 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:17:20,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:20,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:20,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:20,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:20,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:20,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:20,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:20,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:20,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:20,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:20,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:20,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:20,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:20,169 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:17:20,207 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 08:17:20,207 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 08:17:20,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:17:20,210 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:17:20,210 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:17:20,211 INFO L520 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 [] [2018-12-09 08:17:20,225 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 08:17:20,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:17:20,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:20,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:20,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:17:20,289 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 08:17:20,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-12-09 08:17:20,320 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2018-12-09 08:17:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 08:17:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 08:17:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-12-09 08:17:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 08:17:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:20,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-09 08:17:20,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:20,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-09 08:17:20,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:20,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-12-09 08:17:20,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:20,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-12-09 08:17:20,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 08:17:20,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 08:17:20,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-12-09 08:17:20,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 08:17:20,330 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-09 08:17:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-12-09 08:17:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-09 08:17:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-09 08:17:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-12-09 08:17:20,346 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-09 08:17:20,346 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-09 08:17:20,346 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 08:17:20,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-12-09 08:17:20,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:20,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:20,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:20,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:20,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 08:17:20,347 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2018-12-09 08:17:20,347 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 118#L378-2 [2018-12-09 08:17:20,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-12-09 08:17:20,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:17:20,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:17:20,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:17:20,378 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 08:17:20,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-12-09 08:17:20,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:17:20,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:17:20,442 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-09 08:17:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:17:20,461 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-09 08:17:20,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:17:20,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-12-09 08:17:20,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:20,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-12-09 08:17:20,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 08:17:20,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 08:17:20,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-12-09 08:17:20,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 08:17:20,463 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 08:17:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-12-09 08:17:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-09 08:17:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-09 08:17:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-12-09 08:17:20,465 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-09 08:17:20,465 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-09 08:17:20,465 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 08:17:20,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-12-09 08:17:20,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:20,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:20,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:20,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:20,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 08:17:20,466 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2018-12-09 08:17:20,466 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 151#L378-2 [2018-12-09 08:17:20,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-12-09 08:17:20,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:20,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-12-09 08:17:20,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:20,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-12-09 08:17:20,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:20,790 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-09 08:17:20,792 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:17:20,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:17:20,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:17:20,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:17:20,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:17:20,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:17:20,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:17:20,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:17:20,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2018-12-09 08:17:20,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:17:20,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:17:20,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,926 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-09 08:17:20,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:20,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:21,119 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:17:21,119 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:17:21,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:21,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:21,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:21,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:21,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:21,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:21,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:21,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:21,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:21,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:21,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:21,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:21,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:21,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:21,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:21,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:21,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:21,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:21,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:21,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:21,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:21,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:21,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:21,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:21,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:17:21,140 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 08:17:21,140 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 08:17:21,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:17:21,141 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:17:21,141 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:17:21,141 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-09 08:17:21,145 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 08:17:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:21,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:21,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:17:21,173 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 08:17:21,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 08:17:21,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2018-12-09 08:17:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 08:17:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 08:17:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-09 08:17:21,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-09 08:17:21,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:21,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 08:17:21,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:21,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 08:17:21,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:21,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-12-09 08:17:21,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:21,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-12-09 08:17:21,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 08:17:21,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 08:17:21,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-09 08:17:21,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:17:21,185 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-09 08:17:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-09 08:17:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-09 08:17:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 08:17:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-12-09 08:17:21,186 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-09 08:17:21,186 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-09 08:17:21,186 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 08:17:21,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-12-09 08:17:21,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:21,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:21,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:21,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:21,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 08:17:21,188 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));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 !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 250#L378-2 [2018-12-09 08:17:21,188 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 250#L378-2 [2018-12-09 08:17:21,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-12-09 08:17:21,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-12-09 08:17:21,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-12-09 08:17:21,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:21,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 08:17:21,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:17:21,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:17:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:21,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 08:17:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 08:17:21,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-12-09 08:17:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:17:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:17:21,325 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-09 08:17:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:17:21,335 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-09 08:17:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:17:21,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-12-09 08:17:21,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:21,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2018-12-09 08:17:21,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 08:17:21,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 08:17:21,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-09 08:17:21,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:17:21,337 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-09 08:17:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-09 08:17:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-09 08:17:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 08:17:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-12-09 08:17:21,338 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-09 08:17:21,338 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-09 08:17:21,339 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 08:17:21,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-12-09 08:17:21,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:21,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:21,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:21,340 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:21,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 08:17:21,340 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#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; 328#L367 assume !(main_~length~0 < 1); 337#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#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); 329#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 330#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 331#L370-4 main_~j~0 := 0; 332#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); 334#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 335#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); 336#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 341#L378-2 [2018-12-09 08:17:21,340 INFO L796 eck$LassoCheckResult]: Loop: 341#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); 342#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 341#L378-2 [2018-12-09 08:17:21,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2018-12-09 08:17:21,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:17:21,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:17:21,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:17:21,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 08:17:21,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:17:21,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:17:21,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:17:21,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 08:17:21,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-09 08:17:21,422 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 08:17:21,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-12-09 08:17:21,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:17:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:17:21,466 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-12-09 08:17:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:17:21,522 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-12-09 08:17:21,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:17:21,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-12-09 08:17:21,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:21,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2018-12-09 08:17:21,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 08:17:21,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 08:17:21,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-09 08:17:21,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:17:21,524 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-09 08:17:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-09 08:17:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-09 08:17:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 08:17:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-09 08:17:21,526 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 08:17:21,526 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 08:17:21,526 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 08:17:21,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-09 08:17:21,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:21,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:21,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:21,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:21,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 08:17:21,527 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#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; 441#L367 assume !(main_~length~0 < 1); 450#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 451#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 452#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); 455#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 453#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 454#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); 438#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 439#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 456#L370-3 assume !(main_~i~0 < main_~length~0); 442#L370-4 main_~j~0 := 0; 443#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); 449#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 447#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); 448#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 445#L378-2 [2018-12-09 08:17:21,527 INFO L796 eck$LassoCheckResult]: Loop: 445#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); 446#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 445#L378-2 [2018-12-09 08:17:21,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2018-12-09 08:17:21,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-12-09 08:17:21,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:21,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2018-12-09 08:17:21,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:21,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:21,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:21,852 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2018-12-09 08:17:22,050 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2018-12-09 08:17:22,052 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:17:22,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:17:22,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:17:22,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:17:22,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:17:22,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:17:22,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:17:22,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:17:22,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration6_Lasso [2018-12-09 08:17:22,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:17:22,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:17:22,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:17:22,331 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:17:22,331 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:17:22,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:22,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:22,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:22,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:22,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:22,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:22,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:22,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:22,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:22,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:22,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:22,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:22,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:22,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:22,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:17:22,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:17:22,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:17:22,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:22,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:22,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:22,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:22,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:17:22,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 08:17:22,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:17:22,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:17:22,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:17:22,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:17:22,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:17:22,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:17:22,360 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:17:22,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 08:17:22,363 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 08:17:22,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:17:22,364 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:17:22,364 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:17:22,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-09 08:17:22,384 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-09 08:17:22,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:22,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:22,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:17:22,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 08:17:22,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 08:17:22,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2018-12-09 08:17:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 08:17:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 08:17:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-09 08:17:22,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-09 08:17:22,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:22,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-09 08:17:22,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:22,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2018-12-09 08:17:22,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:17:22,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-09 08:17:22,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:22,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-12-09 08:17:22,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 08:17:22,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 08:17:22,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-12-09 08:17:22,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:17:22,444 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 08:17:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-12-09 08:17:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-09 08:17:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 08:17:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-09 08:17:22,445 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 08:17:22,445 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 08:17:22,445 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 08:17:22,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-09 08:17:22,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 08:17:22,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:22,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:22,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:22,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 08:17:22,446 INFO L794 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#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; 583#L367 assume !(main_~length~0 < 1); 594#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 595#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 596#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); 600#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 597#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 598#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); 584#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 585#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 601#L370-3 assume !(main_~i~0 < main_~length~0); 586#L370-4 main_~j~0 := 0; 587#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); 593#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 591#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); 592#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 599#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); 602#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 589#L378-2 [2018-12-09 08:17:22,446 INFO L796 eck$LassoCheckResult]: Loop: 589#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); 590#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 589#L378-2 [2018-12-09 08:17:22,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2018-12-09 08:17:22,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:17:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:17:22,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:17:22,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:17:22,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 08:17:22,556 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-12-09 08:17:22,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:17:22,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:17:22,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 08:17:22,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 08:17:22,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:17:22,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:17:22,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:17:22,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 08:17:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:17:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 08:17:22,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-09 08:17:22,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 08:17:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2018-12-09 08:17:22,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 08:17:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:17:22,699 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-12-09 08:17:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:17:22,758 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-12-09 08:17:22,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:17:22,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-12-09 08:17:22,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 08:17:22,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2018-12-09 08:17:22,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 08:17:22,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 08:17:22,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2018-12-09 08:17:22,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:17:22,761 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-12-09 08:17:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2018-12-09 08:17:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 08:17:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 08:17:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-12-09 08:17:22,764 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-12-09 08:17:22,764 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-12-09 08:17:22,764 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 08:17:22,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2018-12-09 08:17:22,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 08:17:22,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:17:22,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:17:22,765 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:17:22,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-12-09 08:17:22,765 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 712#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; 713#L367 assume !(main_~length~0 < 1); 723#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 724#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 725#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); 714#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 715#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 731#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); 732#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 726#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 727#L370-3 assume !(main_~i~0 < main_~length~0); 716#L370-4 main_~j~0 := 0; 717#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); 719#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 720#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); 721#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 728#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); 744#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 742#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); 739#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 737#L378-2 [2018-12-09 08:17:22,765 INFO L796 eck$LassoCheckResult]: Loop: 737#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); 733#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 734#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); 738#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 737#L378-2 [2018-12-09 08:17:22,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2018-12-09 08:17:22,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:22,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:22,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:22,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-12-09 08:17:22,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:22,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:17:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:17:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2018-12-09 08:17:22,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:17:22,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:17:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:17:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:17:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:17:23,197 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2018-12-09 08:17:23,338 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2018-12-09 08:17:23,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 08:17:23 BoogieIcfgContainer [2018-12-09 08:17:23,357 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 08:17:23,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:17:23,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:17:23,358 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:17:23,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:17:19" (3/4) ... [2018-12-09 08:17:23,360 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 08:17:23,393 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a1cbeee5-438d-4f28-8300-0a5f18de7dfb/bin-2019/uautomizer/witness.graphml [2018-12-09 08:17:23,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:17:23,394 INFO L168 Benchmark]: Toolchain (without parser) took 4312.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -85.7 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2018-12-09 08:17:23,395 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:17:23,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:17:23,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:17:23,396 INFO L168 Benchmark]: Boogie Preprocessor took 13.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:17:23,396 INFO L168 Benchmark]: RCFGBuilder took 138.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:17:23,397 INFO L168 Benchmark]: BuchiAutomizer took 3825.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. [2018-12-09 08:17:23,397 INFO L168 Benchmark]: Witness Printer took 35.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:17:23,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 138.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3825.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. * Witness Printer took 35.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.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 7 terminating modules (4 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 -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 99 SDslu, 79 SDs, 0 SdLazy, 172 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf99 lsp80 ukn93 mio100 lsp53 div160 bol100 ite100 ukn100 eq155 hnf64 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=5, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@480a723e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44182dbb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73d5cb1a=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1e52e36c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73d5cb1a=5, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5edb8654=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1f79ed79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@36685ac5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@11bec0d3=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