./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-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_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/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 cb5770b8d32c05b82025135c2b222cf31b0a4100 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:52:45,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:52:45,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:52:45,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:52:45,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:52:45,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:52:45,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:52:45,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:52:45,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:52:45,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:52:45,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:52:45,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:52:45,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:52:45,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:52:45,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:52:45,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:52:45,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:52:45,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:52:45,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:52:45,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:52:45,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:52:45,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:52:45,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:52:45,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:52:45,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:52:45,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:52:45,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:52:45,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:52:45,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:52:45,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:52:45,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:52:45,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:52:45,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:52:45,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:52:45,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:52:45,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:52:45,096 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 14:52:45,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:52:45,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:52:45,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:52:45,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:52:45,104 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:52:45,104 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 14:52:45,104 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 14:52:45,104 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 14:52:45,104 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 14:52:45,104 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 14:52:45,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:52:45,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 14:52:45,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:52:45,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:52:45,106 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 14:52:45,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:52:45,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:52:45,106 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 14:52:45,107 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 14:52:45,107 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_3c859eb9-eb4d-4575-8ca8-7373313eb107/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 -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2018-12-02 14:52:45,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:52:45,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:52:45,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:52:45,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:52:45,133 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:52:45,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-12-02 14:52:45,169 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/data/fc67efcf4/07ce693f9b6e4874890b58f7546d6a58/FLAG98ac75f56 [2018-12-02 14:52:45,533 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:52:45,533 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-12-02 14:52:45,539 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/data/fc67efcf4/07ce693f9b6e4874890b58f7546d6a58/FLAG98ac75f56 [2018-12-02 14:52:45,909 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/data/fc67efcf4/07ce693f9b6e4874890b58f7546d6a58 [2018-12-02 14:52:45,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:52:45,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:52:45,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:52:45,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:52:45,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:52:45,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:45" (1/1) ... [2018-12-02 14:52:45,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264a29c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:45, skipping insertion in model container [2018-12-02 14:52:45,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:45" (1/1) ... [2018-12-02 14:52:45,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:52:45,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:52:46,094 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:52:46,101 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:52:46,155 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:52:46,176 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:52:46,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46 WrapperNode [2018-12-02 14:52:46,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:52:46,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:52:46,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:52:46,177 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:52:46,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:52:46,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:52:46,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:52:46,205 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:52:46,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:52:46,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:52:46,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:52:46,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:52:46,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/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 14:52:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:52:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:52:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:52:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:52:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:52:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:52:46,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:52:46,450 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-02 14:52:46,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:52:46 BoogieIcfgContainer [2018-12-02 14:52:46,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:52:46,450 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 14:52:46,451 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 14:52:46,453 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 14:52:46,453 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:52:46,453 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:52:45" (1/3) ... [2018-12-02 14:52:46,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2be5887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:52:46, skipping insertion in model container [2018-12-02 14:52:46,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:52:46,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (2/3) ... [2018-12-02 14:52:46,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2be5887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:52:46, skipping insertion in model container [2018-12-02 14:52:46,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:52:46,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:52:46" (3/3) ... [2018-12-02 14:52:46,455 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-12-02 14:52:46,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:52:46,489 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 14:52:46,489 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 14:52:46,489 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 14:52:46,490 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:52:46,490 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:52:46,490 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 14:52:46,490 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:52:46,490 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 14:52:46,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-02 14:52:46,510 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-02 14:52:46,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:46,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:46,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 14:52:46,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:52:46,515 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 14:52:46,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-02 14:52:46,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-02 14:52:46,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:46,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:46,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 14:52:46,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:52:46,521 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2018-12-02 14:52:46,521 INFO L796 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2018-12-02 14:52:46,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,525 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2018-12-02 14:52:46,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:46,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:46,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2018-12-02 14:52:46,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:46,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:46,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:46,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2018-12-02 14:52:46,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,778 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 14:52:46,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:52:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:52:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:52:46,831 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-12-02 14:52:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:46,916 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-12-02 14:52:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:52:46,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-12-02 14:52:46,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:46,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2018-12-02 14:52:46,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-02 14:52:46,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 14:52:46,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-12-02 14:52:46,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:52:46,924 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-02 14:52:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-12-02 14:52:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-02 14:52:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 14:52:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-02 14:52:46,941 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 14:52:46,941 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 14:52:46,941 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 14:52:46,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-02 14:52:46,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:46,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:46,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:46,942 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 14:52:46,942 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:52:46,943 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 92#L-1 havoc main_#res;havoc main_#t~nondet21; 85#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 78#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 79#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 94#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 81#L567-2 [2018-12-02 14:52:46,943 INFO L796 eck$LassoCheckResult]: Loop: 81#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 89#L566 assume !f_#t~short13; 90#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 86#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 81#L567-2 [2018-12-02 14:52:46,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,943 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2018-12-02 14:52:46,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:46,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:46,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2018-12-02 14:52:46,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:46,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:46,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,993 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 14:52:46,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:52:46,994 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:52:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:52:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:52:46,994 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-02 14:52:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,010 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-02 14:52:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:52:47,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-12-02 14:52:47,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:47,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-12-02 14:52:47,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 14:52:47,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 14:52:47,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-12-02 14:52:47,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:52:47,012 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-02 14:52:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-12-02 14:52:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 14:52:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 14:52:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-02 14:52:47,013 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-02 14:52:47,013 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-02 14:52:47,013 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 14:52:47,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-12-02 14:52:47,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:47,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:47,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:47,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 14:52:47,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:52:47,014 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 havoc main_#res;havoc main_#t~nondet21; 131#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 124#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 125#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 140#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 127#L567-2 [2018-12-02 14:52:47,014 INFO L796 eck$LassoCheckResult]: Loop: 127#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 135#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 136#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 132#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 127#L567-2 [2018-12-02 14:52:47,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2018-12-02 14:52:47,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:47,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:47,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2018-12-02 14:52:47,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:52:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:47,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2018-12-02 14:52:47,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:47,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:47,670 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-12-02 14:52:47,901 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-12-02 14:52:47,910 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:52:47,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:52:47,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:52:47,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:52:47,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:52:47,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:52:47,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:52:47,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:52:47,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 14:52:47,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:52:47,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:52:47,926 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 14:52:47,929 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 14:52:47,931 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 14:52:47,932 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 14:52:47,933 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 14:52:47,934 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 14:52:47,936 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 14:52:47,937 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 14:52:47,939 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 14:52:47,940 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 14:52:47,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,943 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 14:52:47,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:52:47,951 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 14:52:47,952 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 14:52:47,953 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 14:52:47,955 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 14:52:48,438 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2018-12-02 14:52:48,533 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 14:52:48,535 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 14:52:48,536 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 14:52:48,874 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:52:48,877 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:52:48,879 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 14:52:48,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,884 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 14:52:48,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,888 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 14:52:48,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,890 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 14:52:48,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,892 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 14:52:48,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,894 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 14:52:48,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,898 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 14:52:48,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,900 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 14:52:48,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,906 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 14:52:48,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,908 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 14:52:48,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,910 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 14:52:48,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,914 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 14:52:48,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,916 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 14:52:48,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,917 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 14:52:48,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,921 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 14:52:48,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,923 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 14:52:48,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,925 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 14:52:48,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,927 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 14:52:48,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,931 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 14:52:48,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,933 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 14:52:48,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,935 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 14:52:48,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:48,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:48,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:48,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,937 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 14:52:48,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,944 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 14:52:48,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,951 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 14:52:48,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,954 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 14:52:48,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,955 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:48,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,956 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:48,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,961 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 14:52:48,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,979 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 14:52:48,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,980 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:48,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:48,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,984 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 14:52:48,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,985 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:48,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,986 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:48,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,989 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 14:52:48,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,994 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 14:52:48,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:48,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:48,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:48,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:48,998 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 14:52:48,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:48,999 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:48,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:48,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:48,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:49,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:49,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:49,003 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 14:52:49,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:49,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:49,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:49,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:49,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:49,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:49,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:49,008 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 14:52:49,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:49,008 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:49,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:49,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:49,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:49,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:49,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:49,012 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 14:52:49,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:49,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:49,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:49,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:49,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:49,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:49,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:52:49,032 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:52:49,033 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 14:52:49,034 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:52:49,035 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 14:52:49,035 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:52:49,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2018-12-02 14:52:49,206 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2018-12-02 14:52:49,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 14:52:49,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:49,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:49,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-02 14:52:49,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-02 14:52:49,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-12-02 14:52:49,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:49,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 14:52:49,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-02 14:52:49,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:49,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-02 14:52:49,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:49,561 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-02 14:52:49,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:49,583 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-02 14:52:49,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:49,608 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 14:52:49,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:49,638 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,657 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,663 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,669 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-02 14:52:49,705 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-12-02 14:52:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:49,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:49,786 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 14:52:49,788 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 14:52:49,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-02 14:52:50,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 34 states and 40 transitions. Complement of second has 10 states. [2018-12-02 14:52:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 14:52:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 14:52:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-12-02 14:52:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 14:52:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:52:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 14:52:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:52:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-02 14:52:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:52:50,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-12-02 14:52:50,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:50,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-12-02 14:52:50,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 14:52:50,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 14:52:50,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-12-02 14:52:50,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:52:50,228 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-02 14:52:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-12-02 14:52:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-12-02 14:52:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 14:52:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-12-02 14:52:50,230 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 14:52:50,230 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 14:52:50,230 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 14:52:50,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-12-02 14:52:50,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:50,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:50,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:50,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 14:52:50,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:52:50,231 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 havoc main_#res;havoc main_#t~nondet21; 506#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 503#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 504#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 505#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 511#L567-5 [2018-12-02 14:52:50,232 INFO L796 eck$LassoCheckResult]: Loop: 511#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 523#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 524#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 519#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 511#L567-5 [2018-12-02 14:52:50,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2018-12-02 14:52:50,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:50,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:50,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:50,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:50,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:50,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2018-12-02 14:52:50,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:50,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:50,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:50,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:50,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:50,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2018-12-02 14:52:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:50,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:50,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:50,381 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-12-02 14:52:50,940 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-12-02 14:52:51,162 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-12-02 14:52:51,165 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:52:51,165 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:52:51,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:52:51,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:52:51,165 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:52:51,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:52:51,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:52:51,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:52:51,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-02 14:52:51,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:52:51,165 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:52:51,168 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 14:52:51,169 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 14:52:51,170 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 14:52:51,171 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 14:52:51,173 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 14:52:51,174 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 14:52:51,175 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 14:52:51,176 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 14:52:51,177 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 14:52:51,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 14:52:51,182 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 14:52:51,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 14:52:51,185 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 14:52:51,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 14:52:51,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 14:52:51,586 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-12-02 14:52:51,674 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 14:52:51,675 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 14:52:51,676 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 14:52:51,677 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 14:52:51,677 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 14:52:51,678 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 14:52:51,679 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 14:52:51,680 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 14:52:51,681 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 14:52:51,682 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 14:52:51,983 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:52:51,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:52:51,984 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 14:52:51,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:51,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:51,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:51,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,987 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 14:52:51,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:51,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:51,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:51,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,988 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 14:52:51,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:51,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:51,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:51,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,990 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 14:52:51,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:51,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:51,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,992 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 14:52:51,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:51,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:51,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:51,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,993 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 14:52:51,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:51,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:51,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,996 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 14:52:51,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:51,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:51,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:51,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,998 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 14:52:51,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:51,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:51,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:51,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:51,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:51,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:51,999 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 14:52:51,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:51,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:51,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,001 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 14:52:52,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:52,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:52,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:52,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,003 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 14:52:52,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,006 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 14:52:52,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:52,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:52,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:52,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,007 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 14:52:52,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:52:52,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:52:52,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:52:52,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,009 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 14:52:52,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,011 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 14:52:52,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,011 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:52,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,012 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:52,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,014 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 14:52:52,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,017 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 14:52:52,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,019 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 14:52:52,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,022 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 14:52:52,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,035 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 14:52:52,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:52:52,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:52:52,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:52:52,040 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 14:52:52,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:52:52,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:52:52,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:52:52,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:52:52,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:52:52,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:52:52,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:52:52,056 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:52:52,056 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 14:52:52,056 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:52:52,057 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 14:52:52,057 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:52:52,057 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2018-12-02 14:52:52,218 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-12-02 14:52:52,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 14:52:52,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:52,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:52,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-02 14:52:52,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-02 14:52:52,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-12-02 14:52:52,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:52,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 14:52:52,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-02 14:52:52,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:52,557 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-02 14:52:52,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:52,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-02 14:52:52,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:52,598 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-02 14:52:52,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:52,619 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 14:52:52,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:52,645 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,658 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,664 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,669 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,680 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-02 14:52:52,700 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-12-02 14:52:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:52,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:52,769 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 14:52:52,769 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 14:52:52,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-02 14:52:52,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2018-12-02 14:52:52,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 14:52:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 14:52:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-02 14:52:52,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 14:52:52,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:52:52,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 14:52:52,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:52:52,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-02 14:52:52,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:52:52,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-02 14:52:52,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:52,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-12-02 14:52:52,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 14:52:52,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 14:52:52,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-12-02 14:52:52,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:52:52,872 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-02 14:52:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-12-02 14:52:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-02 14:52:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 14:52:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-02 14:52:52,874 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 14:52:52,874 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 14:52:52,874 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 14:52:52,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-12-02 14:52:52,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:52,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:52,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:52,875 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:52,875 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 14:52:52,875 INFO L794 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 886#L-1 havoc main_#res;havoc main_#t~nondet21; 872#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 865#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 866#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 891#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 892#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 878#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 879#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 873#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-12-02 14:52:52,875 INFO L796 eck$LassoCheckResult]: Loop: 867#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem16;havoc f_#t~mem15;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 868#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 882#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 897#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 896#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-12-02 14:52:52,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2018-12-02 14:52:52,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2018-12-02 14:52:52,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:52,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:52,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2018-12-02 14:52:52,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:53,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:53,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:52:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:53,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:53,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-02 14:52:53,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-02 14:52:53,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-12-02 14:52:53,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 14:52:53,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-02 14:52:53,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:53,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-02 14:52:53,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:53,274 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-02 14:52:53,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:53,296 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-02 14:52:53,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:53,319 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 14:52:53,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:53,344 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,357 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,364 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,369 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,376 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 14:52:53,398 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:305, output treesize:76 [2018-12-02 14:52:53,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 149 [2018-12-02 14:52:53,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-12-02 14:52:53,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 107 [2018-12-02 14:52:53,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-02 14:52:53,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 104 [2018-12-02 14:52:53,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:53,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-02 14:52:53,589 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,602 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:53,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-02 14:52:53,648 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:237, output treesize:61 [2018-12-02 14:52:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:53,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:52:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-12-02 14:52:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:52:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:52:53,816 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-12-02 14:52:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:54,403 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-02 14:52:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:52:54,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2018-12-02 14:52:54,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:54,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 50 transitions. [2018-12-02 14:52:54,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 14:52:54,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-02 14:52:54,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 50 transitions. [2018-12-02 14:52:54,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:52:54,405 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-02 14:52:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 50 transitions. [2018-12-02 14:52:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-12-02 14:52:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 14:52:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 14:52:54,407 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 14:52:54,407 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 14:52:54,407 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 14:52:54,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-12-02 14:52:54,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:52:54,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:52:54,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:52:54,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:54,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 14:52:54,408 INFO L794 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1056#L-1 havoc main_#res;havoc main_#t~nondet21; 1038#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1035#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1036#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1037#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1065#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1060#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1063#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1051#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1052#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1061#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1064#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1050#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-12-02 14:52:54,408 INFO L796 eck$LassoCheckResult]: Loop: 1042#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem16;havoc f_#t~mem15;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1043#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1059#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1062#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1066#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-12-02 14:52:54,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash 122778203, now seen corresponding path program 1 times [2018-12-02 14:52:54,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:54,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:54,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:54,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:54,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c859eb9-eb4d-4575-8ca8-7373313eb107/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:52:54,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:54,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:54,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-02 14:52:54,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-02 14:52:54,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-12-02 14:52:54,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 14:52:54,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-02 14:52:54,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:54,750 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-02 14:52:54,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:54,769 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-02 14:52:54,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:54,788 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-02 14:52:54,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:54,809 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 14:52:54,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:52:54,847 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,859 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,865 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,875 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,880 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-02 14:52:54,897 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:305, output treesize:76 [2018-12-02 14:52:54,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 108 [2018-12-02 14:52:54,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:52:54,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-02 14:52:54,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-02 14:52:54,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:99, output treesize:84 [2018-12-02 14:52:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:52:54,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 14:52:54,998 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:52:54,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2018-12-02 14:52:54,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:52:54,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:52:54,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:54,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:54,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:52:55,125 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-12-02 14:52:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:52:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:52:55,167 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 14:52:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:55,224 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-12-02 14:52:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:52:55,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2018-12-02 14:52:55,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 14:52:55,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-12-02 14:52:55,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 14:52:55,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 14:52:55,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 14:52:55,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:52:55,225 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:52:55,225 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:52:55,225 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:52:55,225 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 14:52:55,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:52:55,225 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 14:52:55,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 14:52:55,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:52:55 BoogieIcfgContainer [2018-12-02 14:52:55,229 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 14:52:55,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:52:55,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:52:55,229 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:52:55,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:52:46" (3/4) ... [2018-12-02 14:52:55,233 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 14:52:55,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:52:55,233 INFO L168 Benchmark]: Toolchain (without parser) took 9321.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -241.5 MB). Peak memory consumption was 63.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:52:55,234 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:52:55,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -92.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:52:55,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:52:55,235 INFO L168 Benchmark]: Boogie Preprocessor took 16.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:52:55,235 INFO L168 Benchmark]: RCFGBuilder took 228.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:52:55,235 INFO L168 Benchmark]: BuchiAutomizer took 8778.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -185.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:52:55,236 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:52:55,238 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -92.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 228.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8778.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -185.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. Construction of modules took 0.9s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 105 SDslu, 145 SDs, 0 SdLazy, 243 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital545 mio100 ax103 hnf100 lsp93 ukn44 mio100 lsp33 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...