./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:38,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:38,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:38,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:38,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:38,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:38,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:38,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:38,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:38,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:38,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:38,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:38,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:38,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:38,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:38,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:38,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:38,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:38,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:38,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:38,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:38,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:38,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:38,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:38,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:38,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:38,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:38,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:38,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:38,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:38,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:38,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:38,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:38,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:38,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:38,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:38,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:38,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:38,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:38,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:38,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:38,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:02:38,499 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:38,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:38,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:38,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:38,502 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:38,502 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:38,502 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:38,503 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:38,503 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:38,503 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:38,503 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:38,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:38,503 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:38,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:38,504 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:38,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:38,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:38,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:38,505 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:38,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:38,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:38,506 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:38,506 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:38,506 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2019-10-22 09:02:38,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:38,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:38,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:38,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:38,563 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:38,563 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/../../sv-benchmarks/c/termination-15/count_up_alloca.i [2019-10-22 09:02:38,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/data/83870c6b4/8c1c8155ebd34c9cbf36175069a08309/FLAGccc685ec3 [2019-10-22 09:02:39,071 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:39,072 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/sv-benchmarks/c/termination-15/count_up_alloca.i [2019-10-22 09:02:39,079 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/data/83870c6b4/8c1c8155ebd34c9cbf36175069a08309/FLAGccc685ec3 [2019-10-22 09:02:39,585 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/data/83870c6b4/8c1c8155ebd34c9cbf36175069a08309 [2019-10-22 09:02:39,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:39,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:39,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:39,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:39,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:39,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:39" (1/1) ... [2019-10-22 09:02:39,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd4bdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:39, skipping insertion in model container [2019-10-22 09:02:39,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:39" (1/1) ... [2019-10-22 09:02:39,603 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:39,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:39,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:39,981 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:40,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:40,094 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:40,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40 WrapperNode [2019-10-22 09:02:40,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:40,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:40,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:40,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:40,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:40,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:40,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:40,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:40,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:40,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:40,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:40,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:40,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:40,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:40,457 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:40,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:40 BoogieIcfgContainer [2019-10-22 09:02:40,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:40,459 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:40,459 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:40,463 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:40,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:40,464 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:39" (1/3) ... [2019-10-22 09:02:40,465 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@769aaa6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:40, skipping insertion in model container [2019-10-22 09:02:40,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:40,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (2/3) ... [2019-10-22 09:02:40,466 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@769aaa6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:40, skipping insertion in model container [2019-10-22 09:02:40,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:40,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:40" (3/3) ... [2019-10-22 09:02:40,468 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_up_alloca.i [2019-10-22 09:02:40,510 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:40,510 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:40,510 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:40,510 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:40,510 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:40,511 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:40,511 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:40,511 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:40,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:40,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:40,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:40,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:40,549 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:40,549 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:40,550 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:40,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:40,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:40,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:40,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:40,552 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:40,552 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:40,559 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2019-10-22 09:02:40,559 INFO L793 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2019-10-22 09:02:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 09:02:40,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168660131] [2019-10-22 09:02:40,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-10-22 09:02:40,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995048159] [2019-10-22 09:02:40,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,697 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-10-22 09:02:40,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997820799] [2019-10-22 09:02:40,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,731 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,921 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:40,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:40,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:40,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:40,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:40,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:40,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:40,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:40,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration1_Lasso [2019-10-22 09:02:40,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:40,923 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:40,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,337 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:41,342 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:41,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,349 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,358 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,361 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,366 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:41,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:41,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,384 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,395 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:41,395 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:41,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:41,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,404 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:41,405 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:41,507 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:41,538 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:02:41,538 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:02:41,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:41,542 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:41,542 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:41,543 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 09:02:41,552 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:41,650 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:41,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 09:02:41,721 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-10-22 09:02:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-10-22 09:02:41,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:02:41,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:02:41,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 09:02:41,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-10-22 09:02:41,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:41,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-10-22 09:02:41,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:41,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:41,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 09:02:41,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:41,747 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 09:02:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 09:02:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 09:02:41,777 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:41,777 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:41,778 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:41,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 09:02:41,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:41,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:41,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:41,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:41,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:41,780 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2019-10-22 09:02:41,780 INFO L793 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2019-10-22 09:02:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-10-22 09:02:41,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889453140] [2019-10-22 09:02:41,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:41,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889453140] [2019-10-22 09:02:41,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:41,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:41,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204821618] [2019-10-22 09:02:41,847 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-10-22 09:02:41,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228390908] [2019-10-22 09:02:41,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:41,899 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:02:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:41,935 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 09:02:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:41,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 09:02:41,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:41,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-10-22 09:02:41,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:02:41,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:41,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-10-22 09:02:41,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:41,938 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:02:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-10-22 09:02:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-10-22 09:02:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:02:41,940 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:41,940 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:41,940 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:41,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 09:02:41,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:41,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:41,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:41,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:41,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:41,944 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2019-10-22 09:02:41,944 INFO L793 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2019-10-22 09:02:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-10-22 09:02:41,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780206885] [2019-10-22 09:02:41,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-10-22 09:02:41,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327711507] [2019-10-22 09:02:41,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,992 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-10-22 09:02:41,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855479948] [2019-10-22 09:02:41,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,032 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,210 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-22 09:02:42,259 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:42,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:42,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:42,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:42,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:42,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:42,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:42,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:42,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration3_Lasso [2019-10-22 09:02:42,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:42,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:42,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,645 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:42,645 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:42,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,672 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,672 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,677 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,678 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,685 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,685 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,695 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,772 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:42,809 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:42,809 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:02:42,810 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:42,812 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:42,814 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:42,815 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2019-10-22 09:02:42,825 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:42,827 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:42,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:42,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:42,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 09:02:42,925 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-10-22 09:02:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 09:02:42,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:02:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:02:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:02:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-10-22 09:02:42,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:42,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2019-10-22 09:02:42,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:42,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:42,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 09:02:42,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:42,929 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 09:02:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 09:02:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-10-22 09:02:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:02:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-10-22 09:02:42,931 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-10-22 09:02:42,931 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-10-22 09:02:42,932 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:42,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-10-22 09:02:42,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:42,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:42,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:42,933 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:42,933 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:42,933 INFO L791 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2019-10-22 09:02:42,933 INFO L793 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 283#L380-3 [2019-10-22 09:02:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-10-22 09:02:42,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251282197] [2019-10-22 09:02:42,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-10-22 09:02:42,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064553134] [2019-10-22 09:02:42,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-10-22 09:02:42,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615695978] [2019-10-22 09:02:42,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,109 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-22 09:02:43,146 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:43,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:43,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:43,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:43,146 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:43,146 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:43,146 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:43,146 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:43,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration4_Lasso [2019-10-22 09:02:43,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:43,146 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:43,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,498 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:43,498 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:43,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:43,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:43,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,500 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:43,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:43,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:43,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:43,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:43,504 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:43,515 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:43,524 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:43,524 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:02:43,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:43,525 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:43,525 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:43,526 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-10-22 09:02:43,536 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:02:43,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,591 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:43,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:02:43,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2019-10-22 09:02:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:02:43,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 09:02:43,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 09:02:43,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:02:43,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-10-22 09:02:43,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:43,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-10-22 09:02:43,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:43,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:43,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-10-22 09:02:43,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:43,619 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-22 09:02:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-10-22 09:02:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 09:02:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 09:02:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-22 09:02:43,623 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 09:02:43,623 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 09:02:43,623 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:43,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-10-22 09:02:43,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:43,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:43,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:43,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:43,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:43,625 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 421#L369 assume !(main_~length~0 < 1); 427#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 424#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 425#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 418#L374 assume !(main_~val~0 > main_~limit~0); 419#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 422#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 426#L372-3 assume !(main_~i~0 < main_~length~0); 428#L372-4 main_~j~0 := 0; 416#L379-3 assume !!(main_~j~0 < main_~length~0); 417#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 430#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 414#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 415#L379-3 assume !!(main_~j~0 < main_~length~0); 410#L380-3 [2019-10-22 09:02:43,625 INFO L793 eck$LassoCheckResult]: Loop: 410#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 411#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 410#L380-3 [2019-10-22 09:02:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-10-22 09:02:43,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101256657] [2019-10-22 09:02:43,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101256657] [2019-10-22 09:02:43,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407829288] [2019-10-22 09:02:43,730 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27545f13-bab7-4e5c-b446-6f0e2c5a47fa/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:43,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:43,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:43,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,849 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:43,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-10-22 09:02:43,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701010899] [2019-10-22 09:02:43,850 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-10-22 09:02:43,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207265929] [2019-10-22 09:02:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:43,898 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-10-22 09:02:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:44,147 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-10-22 09:02:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:44,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-10-22 09:02:44,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:44,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-10-22 09:02:44,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:44,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:44,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-10-22 09:02:44,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:44,150 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 09:02:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-10-22 09:02:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-22 09:02:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 09:02:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-10-22 09:02:44,152 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 09:02:44,152 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 09:02:44,152 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:44,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-10-22 09:02:44,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:44,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:44,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:44,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:44,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:44,157 INFO L791 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 565#L369 assume !(main_~length~0 < 1); 572#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 567#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 568#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 571#L374 assume !(main_~val~0 > main_~limit~0); 576#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 569#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 570#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 561#L374 assume !(main_~val~0 > main_~limit~0); 562#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 563#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 575#L372-3 assume !(main_~i~0 < main_~length~0); 574#L372-4 main_~j~0 := 0; 559#L379-3 assume !!(main_~j~0 < main_~length~0); 560#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 577#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 557#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 558#L379-3 assume !!(main_~j~0 < main_~length~0); 553#L380-3 [2019-10-22 09:02:44,157 INFO L793 eck$LassoCheckResult]: Loop: 553#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 554#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 553#L380-3 [2019-10-22 09:02:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-10-22 09:02:44,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655306828] [2019-10-22 09:02:44,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,174 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-10-22 09:02:44,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933730605] [2019-10-22 09:02:44,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,181 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-10-22 09:02:44,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606076495] [2019-10-22 09:02:44,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:44,481 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2019-10-22 09:02:44,539 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:44,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:44,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:44,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:44,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:44,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:44,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:44,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:44,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration6_Lasso [2019-10-22 09:02:44,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:44,540 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:44,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,846 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:44,846 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:44,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,849 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,855 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,870 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,870 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,877 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:44,882 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:44,882 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:44,883 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:44,884 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:44,884 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:44,884 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2019-10-22 09:02:44,898 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:02:44,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:44,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:44,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:44,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:44,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:02:44,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-10-22 09:02:44,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 09:02:44,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-10-22 09:02:44,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:44,965 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:44,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:45,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:45,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:45,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:02:45,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-10-22 09:02:45,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 09:02:45,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-10-22 09:02:45,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:45,029 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:45,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:45,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:45,081 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:45,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:02:45,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-10-22 09:02:45,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-10-22 09:02:45,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-10-22 09:02:45,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:45,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-10-22 09:02:45,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:45,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-10-22 09:02:45,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:45,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-10-22 09:02:45,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:45,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-10-22 09:02:45,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:45,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:45,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:45,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:45,103 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:45,103 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:45,103 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:45,104 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:45,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:45,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:45,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:45,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:45 BoogieIcfgContainer [2019-10-22 09:02:45,109 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:45,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:45,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:45,110 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:45,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:40" (3/4) ... [2019-10-22 09:02:45,113 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:45,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:45,115 INFO L168 Benchmark]: Toolchain (without parser) took 5526.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 939.1 MB in the beginning and 772.9 MB in the end (delta: 166.2 MB). Peak memory consumption was 363.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:45,115 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:45,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:45,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:45,116 INFO L168 Benchmark]: Boogie Preprocessor took 21.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:45,117 INFO L168 Benchmark]: RCFGBuilder took 288.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:45,117 INFO L168 Benchmark]: BuchiAutomizer took 4650.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.0 GB in the beginning and 772.9 MB in the end (delta: 271.5 MB). Peak memory consumption was 370.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:45,118 INFO L168 Benchmark]: Witness Printer took 3.85 ms. Allocated memory is still 1.2 GB. Free memory is still 772.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:45,121 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 288.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4650.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.0 GB in the beginning and 772.9 MB in the end (delta: 271.5 MB). Peak memory consumption was 370.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.85 ms. Allocated memory is still 1.2 GB. Free memory is still 772.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 222 SDslu, 71 SDs, 0 SdLazy, 168 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf98 lsp94 ukn79 mio100 lsp54 div100 bol100 ite100 ukn100 eq164 hnf89 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...