./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0c73140129db08253eb2666e014a272764010e16 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:30:50,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:30:50,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:30:50,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:30:50,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:30:50,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:30:50,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:30:50,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:30:50,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:30:50,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:30:50,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:30:50,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:30:50,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:30:50,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:30:50,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:30:50,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:30:50,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:30:50,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:30:50,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:30:50,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:30:50,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:30:50,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:30:50,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:30:50,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:30:50,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:30:50,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:30:50,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:30:50,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:30:50,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:30:50,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:30:50,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:30:50,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:30:50,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:30:50,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:30:50,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:30:50,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:30:50,098 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 09:30:50,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:30:50,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:30:50,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:30:50,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:30:50,106 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 09:30:50,107 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 09:30:50,107 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 09:30:50,107 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 09:30:50,107 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 09:30:50,107 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 09:30:50,107 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 09:30:50,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:30:50,107 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 09:30:50,108 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:30:50,109 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 09:30:50,109 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:30:50,109 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:30:50,109 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 09:30:50,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:30:50,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 09:30:50,109 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 09:30:50,110 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 09:30:50,110 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c73140129db08253eb2666e014a272764010e16 [2018-12-02 09:30:50,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:30:50,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:30:50,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:30:50,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:30:50,137 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:30:50,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-12-02 09:30:50,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/data/59e5d9ede/d012171aaea84e80b07c3665101a7355/FLAG98380236e [2018-12-02 09:30:50,604 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:30:50,604 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-12-02 09:30:50,611 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/data/59e5d9ede/d012171aaea84e80b07c3665101a7355/FLAG98380236e [2018-12-02 09:30:50,619 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/data/59e5d9ede/d012171aaea84e80b07c3665101a7355 [2018-12-02 09:30:50,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:30:50,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:30:50,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:30:50,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:30:50,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:30:50,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50, skipping insertion in model container [2018-12-02 09:30:50,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:30:50,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:30:50,787 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:30:50,794 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:30:50,857 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:30:50,878 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:30:50,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50 WrapperNode [2018-12-02 09:30:50,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:30:50,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:30:50,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:30:50,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:30:50,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:30:50,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:30:50,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:30:50,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:30:50,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... [2018-12-02 09:30:50,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:30:50,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:30:50,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:30:50,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:30:50,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e8ce9c7-bbbd-4a82-93cf-a6094ab3e2b6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:30:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:30:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 09:30:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:30:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:30:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:30:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:30:51,096 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:30:51,096 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 09:30:51,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:30:51 BoogieIcfgContainer [2018-12-02 09:30:51,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:30:51,097 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 09:30:51,097 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 09:30:51,100 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 09:30:51,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 09:30:51,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 09:30:50" (1/3) ... [2018-12-02 09:30:51,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@218e68b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:30:51, skipping insertion in model container [2018-12-02 09:30:51,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 09:30:51,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:30:50" (2/3) ... [2018-12-02 09:30:51,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@218e68b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:30:51, skipping insertion in model container [2018-12-02 09:30:51,103 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 09:30:51,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:30:51" (3/3) ... [2018-12-02 09:30:51,104 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2018-12-02 09:30:51,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:30:51,145 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 09:30:51,146 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 09:30:51,146 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 09:30:51,146 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:30:51,146 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:30:51,146 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 09:30:51,146 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:30:51,146 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 09:30:51,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 09:30:51,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 09:30:51,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:51,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:51,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 09:30:51,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:30:51,177 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 09:30:51,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 09:30:51,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 09:30:51,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:51,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:51,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 09:30:51,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:30:51,186 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2018-12-02 09:30:51,186 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2018-12-02 09:30:51,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 09:30:51,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-12-02 09:30:51,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:51,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:30:51,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:30:51,295 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 09:30:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 09:30:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:30:51,304 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-02 09:30:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:30:51,308 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-02 09:30:51,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 09:30:51,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-12-02 09:30:51,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 09:30:51,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-12-02 09:30:51,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 09:30:51,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 09:30:51,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-12-02 09:30:51,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 09:30:51,314 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-02 09:30:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-12-02 09:30:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 09:30:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 09:30:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-12-02 09:30:51,330 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-02 09:30:51,330 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-02 09:30:51,330 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 09:30:51,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-12-02 09:30:51,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 09:30:51,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:51,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:51,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 09:30:51,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:30:51,331 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2018-12-02 09:30:51,331 INFO L796 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2018-12-02 09:30:51,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 09:30:51,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-12-02 09:30:51,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:30:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-12-02 09:30:51,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:51,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:30:51,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:30:51,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:30:51,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:30:51,496 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-02 09:30:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:30:51,529 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-12-02 09:30:51,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:30:51,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-12-02 09:30:51,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 09:30:51,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-12-02 09:30:51,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 09:30:51,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 09:30:51,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-12-02 09:30:51,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 09:30:51,533 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-12-02 09:30:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-12-02 09:30:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-02 09:30:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 09:30:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-12-02 09:30:51,535 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-02 09:30:51,535 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-02 09:30:51,535 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 09:30:51,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-12-02 09:30:51,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 09:30:51,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:51,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:51,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 09:30:51,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 09:30:51,537 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 78#L554-2 [2018-12-02 09:30:51,537 INFO L796 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2018-12-02 09:30:51,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-12-02 09:30:51,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-12-02 09:30:51,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:30:51,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:51,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:30:51,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:30:51,576 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 09:30:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:30:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:30:51,576 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-02 09:30:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:30:51,592 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-02 09:30:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:30:51,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-02 09:30:51,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-02 09:30:51,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-12-02 09:30:51,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 09:30:51,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 09:30:51,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-02 09:30:51,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 09:30:51,594 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-02 09:30:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-02 09:30:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-02 09:30:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 09:30:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-02 09:30:51,595 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-02 09:30:51,595 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-02 09:30:51,595 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 09:30:51,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-02 09:30:51,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 09:30:51,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:51,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:51,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 09:30:51,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 09:30:51,596 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 114#L554-2 [2018-12-02 09:30:51,596 INFO L796 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2018-12-02 09:30:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-12-02 09:30:51,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-12-02 09:30:51,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:30:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-12-02 09:30:51,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:51,839 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-02 09:30:51,948 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-02 09:30:51,956 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:30:51,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:30:51,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:30:51,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:30:51,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:30:51,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:30:51,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:30:51,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:30:51,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-02 09:30:51,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:30:51,957 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:30:51,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:51,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,217 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-12-02 09:30:52,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:52,603 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:30:52,607 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:30:52,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:52,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:52,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,664 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:52,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,666 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:52,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,686 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:52,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,687 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:52,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:52,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:52,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:52,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:52,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:52,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:52,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:52,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:52,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:52,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:52,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:52,707 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:30:52,717 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 09:30:52,717 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 09:30:52,719 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:30:52,720 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 09:30:52,720 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:30:52,720 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~A.offset) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-12-02 09:30:52,765 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-02 09:30:52,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 09:30:52,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:52,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:52,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:52,829 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 09:30:52,829 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-02 09:30:52,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2018-12-02 09:30:52,857 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 [2018-12-02 09:30:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 09:30:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 09:30:52,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-02 09:30:52,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:52,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-02 09:30:52,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:52,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-12-02 09:30:52,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:52,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-12-02 09:30:52,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 09:30:52,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-12-02 09:30:52,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 09:30:52,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 09:30:52,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-12-02 09:30:52,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:30:52,861 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 09:30:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-12-02 09:30:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-02 09:30:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 09:30:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-12-02 09:30:52,863 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-12-02 09:30:52,863 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-12-02 09:30:52,863 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 09:30:52,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-12-02 09:30:52,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 09:30:52,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:52,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:52,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 09:30:52,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 09:30:52,864 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 258#L574 assume !(main_~Alen~0 < 1); 259#L574-2 assume !(main_~Blen~0 < 1); 270#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 268#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 261#L558-2 [2018-12-02 09:30:52,864 INFO L796 eck$LassoCheckResult]: Loop: 261#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 260#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 261#L558-2 [2018-12-02 09:30:52,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-12-02 09:30:52,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:52,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:52,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:52,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:52,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:52,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-12-02 09:30:52,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:52,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:52,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-12-02 09:30:52,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:52,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:52,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:52,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:52,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:53,096 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2018-12-02 09:30:53,177 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:30:53,177 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:30:53,177 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:30:53,177 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:30:53,177 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:30:53,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:30:53,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:30:53,178 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:30:53,178 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 09:30:53,178 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:30:53,178 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:30:53,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,365 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-12-02 09:30:53,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:53,774 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:30:53,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:30:53,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:53,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:53,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:53,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:53,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:53,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:53,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:53,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:53,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:53,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:53,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:53,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,801 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:53,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,802 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:53,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:53,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:53,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:53,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:53,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:53,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:53,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:53,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:53,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:53,846 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:30:53,867 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 09:30:53,867 INFO L444 ModelExtractionUtils]: 68 out of 73 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 09:30:53,868 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:30:53,868 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 09:30:53,868 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:30:53,868 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-12-02 09:30:53,898 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-02 09:30:53,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:53,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:53,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:53,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 09:30:53,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 09:30:53,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2018-12-02 09:30:53,946 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 [2018-12-02 09:30:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 09:30:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 09:30:53,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-02 09:30:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:53,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 09:30:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:53,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 09:30:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:53,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-12-02 09:30:53,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 09:30:53,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-12-02 09:30:53,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 09:30:53,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 09:30:53,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-12-02 09:30:53,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:30:53,950 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-12-02 09:30:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-12-02 09:30:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-02 09:30:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 09:30:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-02 09:30:53,952 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-02 09:30:53,952 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-02 09:30:53,952 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 09:30:53,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-12-02 09:30:53,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 09:30:53,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:53,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:53,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:30:53,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 09:30:53,953 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 420#L574 assume !(main_~Alen~0 < 1); 425#L574-2 assume !(main_~Blen~0 < 1); 433#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 429#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 430#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 437#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 438#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 435#L557-2 assume !(0 == diff_~found~0); 426#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 427#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 422#L558-2 [2018-12-02 09:30:53,953 INFO L796 eck$LassoCheckResult]: Loop: 422#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 421#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 422#L558-2 [2018-12-02 09:30:53,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2018-12-02 09:30:53,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:53,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:53,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:30:53,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:30:53,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:30:53,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 09:30:53,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:53,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-12-02 09:30:53,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:53,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:53,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:30:53,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:30:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:30:54,013 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-02 09:30:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:30:54,022 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-12-02 09:30:54,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:30:54,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2018-12-02 09:30:54,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 09:30:54,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2018-12-02 09:30:54,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 09:30:54,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 09:30:54,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-12-02 09:30:54,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:30:54,024 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-02 09:30:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-12-02 09:30:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-02 09:30:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 09:30:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-12-02 09:30:54,025 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-12-02 09:30:54,025 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-12-02 09:30:54,025 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 09:30:54,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-12-02 09:30:54,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 09:30:54,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:30:54,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:30:54,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:30:54,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 09:30:54,026 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 468#L574 assume !(main_~Alen~0 < 1); 473#L574-2 assume !(main_~Blen~0 < 1); 480#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 477#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 478#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 486#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 484#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 482#L557-2 assume !(0 == diff_~found~0); 474#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 475#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 470#L558-2 [2018-12-02 09:30:54,026 INFO L796 eck$LassoCheckResult]: Loop: 470#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 469#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 470#L558-2 [2018-12-02 09:30:54,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-12-02 09:30:54,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:54,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:54,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:30:54,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2018-12-02 09:30:54,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:54,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:54,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:30:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-12-02 09:30:54,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:30:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:30:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:54,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:30:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:30:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:30:54,406 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2018-12-02 09:30:54,492 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:30:54,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:30:54,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:30:54,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:30:54,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:30:54,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:30:54,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:30:54,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:30:54,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-02 09:30:54,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:30:54,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:30:54,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:54,715 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2018-12-02 09:30:54,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:30:55,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:30:55,058 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:30:55,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:30:55,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:30:55,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:30:55,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:55,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:55,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,106 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:55,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,107 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:55,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,116 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 09:30:55,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,118 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 09:30:55,118 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 09:30:55,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:30:55,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,144 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:30:55,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:30:55,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 09:30:55,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:30:55,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:30:55,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:30:55,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:30:55,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:30:55,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:30:55,189 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:30:55,209 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 09:30:55,209 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 09:30:55,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:30:55,210 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 09:30:55,210 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:30:55,211 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-12-02 09:30:55,247 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-12-02 09:30:55,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:55,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:55,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:55,278 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 09:30:55,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 09:30:55,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2018-12-02 09:30:55,291 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 [2018-12-02 09:30:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 09:30:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-02 09:30:55,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-02 09:30:55,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:55,292 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 09:30:55,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:55,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:55,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:55,325 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 [2018-12-02 09:30:55,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 09:30:55,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2018-12-02 09:30:55,334 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 [2018-12-02 09:30:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 09:30:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-02 09:30:55,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-02 09:30:55,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:55,335 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 09:30:55,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:30:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:55,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:30:55,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:30:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:30:55,365 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 [2018-12-02 09:30:55,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 09:30:55,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 34 states and 49 transitions. Complement of second has 6 states. [2018-12-02 09:30:55,376 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 [2018-12-02 09:30:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 09:30:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-12-02 09:30:55,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-02 09:30:55,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:55,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 09:30:55,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:55,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-02 09:30:55,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:30:55,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2018-12-02 09:30:55,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 09:30:55,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-12-02 09:30:55,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 09:30:55,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 09:30:55,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 09:30:55,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 09:30:55,378 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:30:55,378 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:30:55,378 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:30:55,378 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 09:30:55,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 09:30:55,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 09:30:55,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 09:30:55,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 09:30:55 BoogieIcfgContainer [2018-12-02 09:30:55,384 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 09:30:55,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:30:55,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:30:55,385 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:30:55,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:30:51" (3/4) ... [2018-12-02 09:30:55,388 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 09:30:55,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:30:55,389 INFO L168 Benchmark]: Toolchain (without parser) took 4768.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -295.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:55,390 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:30:55,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:55,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:55,391 INFO L168 Benchmark]: Boogie Preprocessor took 19.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:30:55,391 INFO L168 Benchmark]: RCFGBuilder took 167.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:55,391 INFO L168 Benchmark]: BuchiAutomizer took 4287.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -149.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:55,392 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:30:55,395 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 167.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4287.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -149.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[A] + -1 * A and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 127 SDtfs, 126 SDslu, 59 SDs, 0 SdLazy, 74 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax106 hnf99 lsp84 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...